Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
proof rules
Description:
Inference rules that specify which conclusions can be derived from given premises in a formal logic or program system.
Primary topic:
Logic, programming, and type systems (58%)
Related topics:
Logic, programming, and type systems (58%),
Formal Methods in Verification (16%)
OpenAlex ID:
keywords/proof-rules
Monitors: an operating system structuring concept
1974
·
C. A. R. Hoare
·
Communications of the ACM
·
1,769
PDF
Composing specifications
1993
·
Martín Abadi
, Leslie Lamport
·
ACM Transactions on Programming Languages and Systems
·
506
PDF
Characterizing correctness properties of parallel programs using fixpoints
1980
·
E. Allen Emerson
, Edmund M. Clarke
·
Lecture notes in computer science
·
454
Monitors: An Operating System Structuring Concept
1974
·
C. A. R. Hoare
·
Springer eBooks
·
353
Synthesizing software verifiers from proof rules
2012
·
Sergey Grebenshchikov
, Nuno P. Lopes
, et al.
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
323
A type-theoretical alternative to ISWIM, CUCH, OWHY
1993
·
Dana S. Scott
·
Theoretical Computer Science
·
314
Transition invariants
2004
·
A. Podelski
, A. Rybalchenko
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
276
Bases for equational theories of semigroups
1969
·
Peter Perkins
·
Journal of Algebra
·
265
PDF
Transition invariants
2004
·
Andreas Podelski
, Andrey Rybalchenko
·
Max Planck Institute for Plasma Physics
·
258
Separation and information hiding
2004
·
Peter W. O'Hearn
, Hongseok Yang
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
255
Specifications in an arbitrary institution
1988
·
Donald Sannella
, Andrzej Tarlecki
·
Information and Computation
·
251
Verifying hybrid systems
1993
·
Zohar Manna
, Amir Pnueli
·
Lecture notes in computer science
·
195
Abstract and Model Check while You Prove
1999
·
Hassen Saïdi
, Natarajan Shankar
·
Lecture notes in computer science
·
179
PDF
'Cause I'm strong enough: Reasoning about consistency choices in distributed systems
2016
·
Alexey Gotsman
, Hongseok Yang
, et al.
·
ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL)
·
177
PDF
Abstraction and verification in Alphard: defining and specifying iteration and generators
1977
·
Mary Shaw
, William A. Wulf
, et al.
·
Communications of the ACM
·
177
PDF
Recursive data structures
1975
·
C. A. R. Hoare
·
International Journal of Parallel Programming
·
173
A proof technique for communicating sequential processes
1981
·
Gary Marc Levin
, David Gries
·
Acta Informatica
·
171
Proof Rules for Automated Compositional Verification through Learning
2003
·
Barringer, Howard
, Giannakopolou, Dimitra
, et al.
·
Research Explorer (The University of Manchester)
·
155
A new proof rule for almost-sure termination
2017
·
Annabelle McIver
, Carroll Morgan
, et al.
·
Proceedings of the ACM on Programming Languages
·
143
PDF
The reachability-bound problem
2010
·
Sumit Gulwani
, Florian Zuleger
·
ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
·
135
A proof technique for rely/guarantee properties
1985
·
Eugene W. Stark
·
Lecture notes in computer science
·
127
Proof rules for the programming language Euclid
1978
·
R.L. London
, J.V. Guttag
, et al.
·
Acta Informatica
·
119
Practical Theory Extension in Event-B
2013
·
Michael Butler
, Issam Maamria
·
Lecture notes in computer science
·
113
Composing specifications
1990
·
Martín Abadi
, Leslie Lamport
·
Lecture notes in computer science
·
113
Proofs, pictures, and Euclid
2009
·
John Mumma
·
Synthese
·
111
Show more works
View as search
Works count:
777
Citation count:
14,960
Year
Topic
Type