Countable nondeterminism and random assignment
Journal of the ACM (JACM)
“A la Floyd” induction principles for proving inevitability
Algebraic methods in semantics
Proceedings of the first Franco-Japanese Symposium on Programming of future generation computers
A partial ordering semantics for CCS
Theoretical Computer Science
A non-standard inductive semantics
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
The meaning of negative premises in transition system specifications (extended abstract)
Proceedings of the 18th international colloquium on Automata, languages and programming
Transition system specifications with negative premises (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B): formal models and semantics
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Operational and algebraic semantics of concurrent processes
Handbook of theoretical computer science (vol. B)
Co-induction in relational semantics
Theoretical Computer Science
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
Completeness and predicate-based abstract interpretation
PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A unifying view of abstract domain design
ACM Computing Surveys (CSUR)
Structural operational semantics as a basis for static program analysis
ACM Computing Surveys (CSUR)
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Complementation in abstract interpretation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program analysis: the abstract interpretation perspective
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
Types as abstract interpretations
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From SOS rules to proof principles: an operational metatheory for functional languages
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data flow analysis is model checking of abstract interpretations
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Trace-Based Abstract Interpretation of Operational Semantics
Lisp and Symbolic Computation
Making abstract interpretations complete
Journal of the ACM (JACM)
A characterization of symmetric semantics by domain complementation
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Compositionality in the puzzle of semantics
PEPM '02 Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Checking security of Java bytecode by abstract interpretation
Proceedings of the 2002 ACM symposium on Applied computing
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Abstract interpretation of operational semantics for secure information flow
Information Processing Letters
Operational semantics of termination types
Nordic Journal of Computing
Set-Based Failure Analysis for Logic Programs and Concurrent Constraint Programs
ESOP '99 Proceedings of the 8th European Symposium on Programming Languages and Systems
How to Transform an Analyzer into a Verifier
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
PADO '01 Proceedings of the Second Symposium on Programs as Data Objects
On Small Depth Threshold Circuits
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
An Experiment in Type Inference and Verification by Abstract Interpretation
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
The Varieties of Programming Language Semantics
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Semantics for Abstract Interpretation-Based Static Analyzes of Temporal Properties
SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Abstract Interpretation Based Formal Methods and Future Challenges
Informatics - 10 Years Back. 10 Years Ahead.
Logical Specification of Operational Semantics
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Non-Standard Semantics for Program Slicing
Higher-Order and Symbolic Computation
Abstract non-interference: parameterizing non-interference by abstract interpretation
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Abstract interpretation based verification of logic programs
Science of Computer Programming
Reduced Models for Efficient CCS Verification
Formal Methods in System Design
Transforming semantics by abstract interpretation
Theoretical Computer Science
Control Code Obfuscation by Abstract Interpretation
SEFM '05 Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods
Instruction-level security analysis for information flow in stack-based assembly languages
Information and Computation
Bi-inductive Structural Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Bi-inductive structural semantics
Information and Computation
Coinductive big-step operational semantics
Information and Computation
Trace-Based Coinductive Operational Semantics for While
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Theoretical Computer Science
A Proof Calculus for Natural Semantics Based on Greatest Fixed Point Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract interpretation of non-monotone bi-inductive semantic definitions
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Subtyping, declaratively: an exercise in mixed induction and coinduction
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Amortized resource analysis with polymorphic recursion and partial big-step operational semantics
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
An abstract interpretation framework for termination
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programming with binders and indexed data-types
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Propositional interpolation and abstract interpretation
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
A hoare logic for the coinductive trace-based big-step semantics of while
ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
Coinductive big-step operational semantics
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
A generic architecture for data flow analysis to support reverse engineering
Algebraic'97 Proceedings of the 2nd international conference on Theory and Practice of Algebraic Specifications
Formal verification by abstract interpretation
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Multivariate amortized resource analysis
ACM Transactions on Programming Languages and Systems (TOPLAS)
Operational semantics using the partiality monad
Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
A logical correspondence between natural semantics and abstract machines
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
A galois connection calculus for abstract interpretation
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
We introduce and illustrate a specification method combining rule-based inductive definitions, well-founded induction principles, fixed-point theory and abstract interpretation for general use in computer science. Finite as well as infinite objects can be specified, at various levels of details related by abstraction. General proof principles are applicable to prove properties of the specified objects.The specification method is illustrated by introducing G ∞ SOS, a structured operational semantics generalizing Plotkin's [28] structured operational semantics (SOS) so as to describe the finite, as well as the infinite behaviors of programs in a uniform way and by constructively deriving inductive presentations of the other (relational, denotational, predicate transformers, …) semantics from G ∞ SOS by abstract interpretation.