This description was written by a machine and published without a person checking it. It is what the agent made of this grouping, and not a statement anybody has stood behind.
Journal of the ACM
A conference, workshop or journal: the thing that recurs, across all its years.
The ACM's oldest and most selective journal, taking major results across the whole of computer science. Papers here are long, thoroughly refereed and expected to matter for decades rather than for a conference cycle.
24 references
Compositional Shape Analysis by Means of Bi-Abduction
Cristiano Calcagno and others (2011) · Journal of the ACM · Association for Computing Machinery
Simplify: a theorem prover for program checking
David Detlefs and others (2005) · Journal of the ACM · Association for Computing Machinery
Counterexample-guided abstraction refinement for symbolic model checking
Edmund Clarke and others (2003) · Journal of the ACM · Association for Computing Machinery (ACM)
Timed regular expressions
Eugene Asarin and others (2002) · Journal of the ACM · Association for Computing Machinery
A methodology for hardware verification based on logic simulation
Randal E. Bryant (1991) · Journal of the ACM · Association for Computing Machinery
Knowledge and common knowledge in a distributed environment
Joseph Y. Halpern and others (1990) · Journal of the ACM · Association for Computing Machinery (ACM)
Complexity of network synchronization
Baruch Awerbuch (1985) · Journal of the ACM · Association for Computing Machinery
Impossibility of distributed consensus with one faulty process
Michael J. Fischer and others (1985) · Journal of the ACM · Association for Computing Machinery
Effective axiomatizations of Hoare logics
Edmund M. Clarke Jr. and others (1983) · Journal of the ACM
Alternation
Ashok K. Chandra and others (1981) · Journal of the ACM · Association for Computing Machinery
Reaching Agreement in the Presence of Faults
M. Pease and others (1980) · Journal of the ACM · Association for Computing Machinery
A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
John C. Cherniavsky and others (1979) · Journal of the ACM · Association for Computing Machinery
Programming language constructs for which it is impossible to obtain good Hoare axiom systems
Edmund M. Clarke Jr. (1979) · Journal of the ACM
Concurrent Processes and Their Syntax
George Milne and others (1979) · Journal of the ACM · Association for Computing Machinery (ACM)
A New Incompleteness Result for Hoare's System
Mitchell Wand (1978) · Journal of the ACM · Association for Computing Machinery
Even Simple Programs Are Hard To Analyze
Neil D. Jones and others (1977) · Journal of the ACM · Association for Computing Machinery (ACM)
Decidable Properties of Monadic Functional Schemas
Edward A. Ashcroft and others (1973) · Journal of the ACM · Association for Computing Machinery
Formalization of Properties of Functional Programs
Zohar Manna and others (1970) · Journal of the ACM · Association for Computing Machinery (ACM)
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Gregory J. Chaitin (1969) · Journal of the ACM · Association for Computing Machinery
Nondeterministic Algorithms
Robert W. Floyd (1967) · Journal of the ACM · Association for Computing Machinery
On Context-Free Languages
Rohit Parikh (1966) · Journal of the ACM · Association for Computing Machinery
A Machine-Oriented Logic Based on the Resolution Principle
John A. Robinson (1965) · Journal of the ACM · Association for Computing Machinery
A State Variable Assignment Method for Asynchronous Sequential Switching Circuits
C. N. Liu (1963) · Journal of the ACM · Association for Computing Machinery
A Computing Procedure for Quantification Theory
Martin Davis and others (1960) · Journal of the ACM · Association for Computing Machinery