Science Explorer Back to mapMap
Institution · Kestrel Institute

Most cited papers from Kestrel Institute

What are the most cited papers from Kestrel Institute?

The most cited paper from Kestrel Institute is "Information-Flow Analysis of Android Applications in DroidSafe" (Michael I. Gordon, Deokhwan Kim, Jeff H. Perkins et al., 2015), with 429 citations. Next come "KIDS: a semiautomatic program development system" (355) and "Software Technology in the 1990's: Using a New Paradigm" (353).

Showing 50 of 59 papers. Every paper with more than 23 citations is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Information-Flow Analysis of Android Applications in DroidSafe Michael I. Gordon, Deokhwan Kim, Jeff H. Perkins et al. Conference paper 2015 429
2 KIDS: a semiautomatic program development system Douglas R. Smith · IEEE Transactions on Software Engineering 1990 355
3 Software Technology in the 1990's: Using a New Paradigm Balzer, Cheatham, Green · Computer Nov 1983 353
4 Incremental recomputation of active relational expressions Xiaolei Qian, Gio C. M. Wiederhold · IEEE Transactions on Knowledge and Data Engineering 1991 186
5 Top-down synthesis of divide-and-conquer algorithms Douglas R. Smith · Artificial Intelligence Sep 1985 156
6 A derivation system and compositional logic for security protocols Anupam Datta, Ante Đerek, John C. Mitchell et al. · Journal of Computer Security 24 Aug 2005 152
7 Research on Knowledge-Based Software Environments at Kestrel Institute Douglas R. Smith, G.B. Kotik, Stephen J. Westfold · IEEE Transactions on Software Engineering Nov 1985 139
8 Specware: Formal support for composing software Yellamraju V. Srinivas, Richard K. Jullig · Lecture notes in computer science Conference paper 1995 138
9 Time representation: a taxonomy of interval relations Peter Bernard Ladkin 11 Aug 1986 136
10 A compositional logic for proving security properties of protocols* Nancy Durgin, John C. Mitchell, Duško Pavlović · Journal of Computer Security Oct 2003 130
11 Distance Bounding Protocols: Authentication Logic Analysis and Collusion Attacks Catherine A. Meadows, Radha Poovendran, Duško Pavlović et al. · Advances in information security Book chapter Dec 2007 90
12 Algorithm theories and design tactics Douglas R. Smith, Michael Lowry · Science of Computer Programming Open access Oct 1990 87
13 Distributed Coordination through Anarchic Optimization Stephen Fitzpatrick, Lambert Meertens · Multiagent systems, artificial societies, and simulated organizations Book chapter 2003 78
14 A specification of Java loading and bytecode verification Allen Goldberg Conference paper Nov 1998 77
15 Applications of feasible path analysis to program testing Allen Goldberg, T. C. Wang, David K. Zimmerman Conference paperOpen access 1994 75
16 Automating software design Michael Lowry Conference paper 7 Jan 2003 75
17 A compositional logic for protocol correctness Nancy Durgin, John C. Mitchell, Duško Pavlović Conference paper 29 Aug 2005 74
18 A derivation system for security protocols and its logical formalization Anupam Datta, Ante Đerek, John C. Mitchell et al. Conference paper 24 Jan 2004 73
19 Applications of a strategy for designing divide-and-conquer algorithms Douglas R. Smith · Science of Computer Programming Open access Jun 1987 71
20 An architecture for emotional agents Antonio Camurri, Alessandro Coglio · IEEE Multimedia 1998 71
21 Roadmap for enhanced languages and methods to aid verification Gary T. Leavens, Jean-Raymond Abrial, Don S. Batory et al. Conference paper 22 Oct 2006 70
22 Primitives and units for time specification Peter Bernard Ladkin 11 Aug 1986 69
23 An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs Stephen Fitzpatrick, Lambert Meertens · Lecture notes in computer science Conference paper 2001 64
24 Calculus in coinductive form Duško Pavlović, Martı́n Hötzel Escardó Conference paper 27 Nov 2002 58
25 Secure protocol composition Anupam Datta, Ante Đerek, John C. Mitchell et al. Conference paper 30 Oct 2003 57
26 An Encapsulated Authentication Logic for Reasoning about Key Distribution Protocols Iliano Cervesato, Catherine A. Meadows, Duško Pavlović Conference paper 6 Jul 2005 52
27 Constructing specification morphisms Douglas R. Smith · Journal of Symbolic Computation Open access May 1993 48
28 Models of axioms for time intervals Peter Bernard Ladkin · National Conference on Artificial Intelligence Conference paper 13 Jul 1987 48
29 Stream processing Allen Goldberg, Robert A. Paige Conference paperOpen access 1984 45
30 Transformational approach to transportation scheduling Douglas R. Smith, E. Parra Conference paper 30 Dec 2002 45
31 The completeness of a natural system for reasoning with time intervals Peter Bernard Ladkin · International Joint Conference on Artificial Intelligence Conference paper 23 Aug 1987 45
32 Deriving, Attacking and Defending the GDOI Protocol Catherine A. Meadows, Duško Pavlović · Lecture notes in computer science Conference paper 2004 43
33 Planware-domain-specific synthesis of high-performance schedulers L. Blaine, Limei Gilham, Junbo Liu et al. Conference paper 27 Nov 2002 42
34 Standard fixpoint iteration for Java bytecode verification Zhenyu Qian · ACM Transactions on Programming Languages and Systems Open access Jul 2000 41
35 Testing Semantics: Connecting Processes and Process Logics Duško Pavlović, Michael W. Mislove, James Worrell · Lecture notes in computer science Conference paper 2006 41
36 A formal specification of Java class loading Zhenyu Qian, Allen Goldberg, Alessandro Coglio Conference paper Oct 2000 40
37 Toward a classification approach to design Douglas R. Smith · Lecture notes in computer science Conference paper 1996 40
38 Knowledge-based programming: A survey of program design and construction techniques Allen Goldberg · IEEE Transactions on Software Engineering Jul 1986 38
39 Intelligent Systems and Formal Methods in Software Engineering Bernhard Beckert, Tony Hoare, Reiner Hähnle et al. · IEEE Intelligent Systems Nov 2006 35
40 Distributed Real-Time Managed Systems: A Model-Driven Distributed Secure Information Architecture Platform for Managed Embedded Systems Tihamér Levendovszky, Abhishek Kumar Dubey, William R. Otte et al. · IEEE Software 31 Jan 2014 34
41 Composition and refinement of behavioral specifications Duško Pavlović, Douglas R. Smith Conference paper 25 Aug 2005 33
42 An effective method for integrity constraint simplification Xiaoyan Qian Conference paper 6 Jan 2003 33
43 A software platform for fractionated spacecraft Abhishek Kumar Dubey, William Emfinger, Aniruddha S. Gokhale et al. Conference paper Mar 2012 31
44 Run-Time Assurance for Learning-Enabled Systems Darren D. Cofer, Isaac Amundson, Ramachandra J. Sattigeri et al. · Lecture notes in computer science Conference paper 2020 30
45 Duality for Labelled Markov Processes Michael W. Mislove, Joël Ouaknine, Duško Pavlović et al. · Lecture notes in computer science Conference paperOpen access 2004 30
46 Software Development by Refinement Duško Pavlović, Douglas R. Smith · Lecture notes in computer science Conference paper 2003 29
47 Satisfying first-order constraints about time intervals Peter Bernard Ladkin · National Conference on Artificial Intelligence Conference paper 21 Aug 1988 27
48 Toward a provably-correct implementation of the JVM bytecode verifier Alessandro Coglio, Allen Goldberg, Zhenyu Qian Conference paper 7 Nov 2002 27
49 A Generative Approach to Aspect-Oriented Programming Douglas R. Smith · Lecture notes in computer science Conference paper 2004 26
50 Reusing software developments Allen Goldberg Conference paperOpen access Oct 1990 26

Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for an institution when any of its authors gave it as an affiliation; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.