Countable nondeterminism and random assignment
Journal of the ACM (JACM)
Storing and evaluating Horn-clause rules in a relational database
IBM Journal of Research and Development
Communications of the ACM
Full abstraction of a real-time denotational semantics for an OCCAM-like language
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Generalized Message-Passing Mechanism for Communicating Sequential Processes
IEEE Transactions on Computers
A compilation technique for software pipelining of loops with conditional jumps
ACM SIGMICRO Newsletter
Verification of Ada 1/0 statements
ACM SIGCSE Bulletin
A first course in program verification and the semantics of programming languages
SIGCSE '89 Proceedings of the twentieth SIGCSE technical symposium on Computer science education
Towards fully abstract semantics for local variables
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formal approach to program inversion
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Floyd-Hoare logic in iteration theories
Journal of the ACM (JACM)
A compilation technique for software pipelining of loops with conditional jumps
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
Reasoning about Java classes: preliminary report
Proceedings of the 13th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Logical and mathematical reasoning about imperative programs: preliminary report
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constraints: a uniform approach to aliasing and typing
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program slicing based on specification
Proceedings of the 2001 ACM symposium on Applied computing
A Hoare logic for dynamic networks of asychronously communicating deterministic processes
Theoretical Computer Science
Making variables abstract: an equational theory for Russell
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Axiomatic definability and completeness for recursive programs
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
IEEE Transactions on Software Engineering
Using Term Rewriting to Verify Software
IEEE Transactions on Software Engineering
Java Program Verification via a Hoare Logic with Abrupt Termination
FASE '00 Proceedings of the Third Internationsl Conference on Fundamental Approaches to Software Engineering: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Semantics and Implementation of a Generalized forall Statement for Parallel Languages
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Masking System Crashes in Database Application Programs
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Verifying Probabilistic Programs Using a Hoare like Logic
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Metatheory of Verification Calculi in LEGO - To what Extent Does Syntax Matter?
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Compiling Horn-Clause Rules in IBM`s Business System 12 and Early Experiment in Declarativeness
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A Denotational Semantics for First-Order Logic
CL '00 Proceedings of the First International Conference on Computational Logic
On Excusable and Inexcusable Failures
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
From Kleene Algebra to Refinement Algebra
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Reliability assessment through probabilistic refinement
Nordic Journal of Computing
The semantics of local storage, or what makes the free-list free?(Preliminary Report)
POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A case for teaching program verification: Its importance in the CS curriculum
SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Logic versus mathematics in computer science education
SIGCSE '83 Proceedings of the fourteenth SIGCSE technical symposium on Computer science education
Denotational semantics of concurrency
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
An axiomatization of low-level parallelism in microarchitectures
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Formal semantics for the automated derivation of micro-code
DAC '82 Proceedings of the 19th Design Automation Conference
On the scope of static checking in definitional languages
ACM '84 Proceedings of the 1984 annual conference of the ACM on The fifth generation challenge
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
The description logic handbook
On formal and informal proofs for program correctness
ACM SIGPLAN Notices
De Bakker-Zucker processes revisited
Information and Computation
Automated black-box testing of functional correctness using function approximation
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Some thoughts arising from a language design effort
ACM SIGSOFT Software Engineering Notes - Proceedings of VERkshop III -- a formal verification workshop
Abstract versus concrete computation on metric partial algebras
ACM Transactions on Computational Logic (TOCL)
An epistemic proof system for parallel processes: extended abstract
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
ASM Refinement and generalizations of forward simulation in data refinement: a comparison
Theoretical Computer Science - Abstract state machines and high-level system design and analysis
Semantics of plan revision in intelligent agents
Theoretical Computer Science - Algebraic methodology and software technology
Extending separation logic with fixpoints and postponed substitution
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Programming Languages and Systems (TOPLAS)
To use or not to use the goto statement: programming styles viewed from Hoare logic
Science of Computer Programming
Knowledge-Based Asynchronous Programming
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
Topology in PVS: continuous mathematics with applications
Proceedings of the second workshop on Automated formal methods
A Mechanical Analysis of Program Verification Strategies
Journal of Automated Reasoning
Completeness of ASM Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Our Quest for the Holy Grail of Agent Verification
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
Asynchronous Exceptions as an Effect
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Toward a programming theory for rational agents
Autonomous Agents and Multi-Agent Systems
Relational Semantics Revisited
Electronic Notes in Theoretical Computer Science (ENTCS)
A uniform framework for concept definitions in description logics
Journal of Artificial Intelligence Research
Peano Structures and the Semantics of Iteration
Electronic Notes in Theoretical Computer Science (ENTCS)
Alternating states for dual nondeterminism in imperative programming
Theoretical Computer Science
On revival of Algol-concepts in modern programming and specification languages
Formal methods and hybrid real-time systems
Comparing goal-oriented and procedural service orchestration
Multiagent and Grid Systems
Enriching EL-Concepts with Greatest Fixpoints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Descriptive and relative completeness of logics for higher-order functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Dynamic logic for plan revision in intelligent agents
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
MATES'05 Proceedings of the Third German conference on Multiagent System Technologies
Verification of object-oriented programs: A transformational approach
Journal of Computer and System Sciences
A compositional semantics of plan revision in intelligent agents
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Plan generation and plan execution in agent programming
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
A mechanism for exception handling and its verification rules
Computer Languages
The functional life cycle model and its automation: USE.IT
Journal of Systems and Software
Proof Methods for Corecursive Programs
Fundamenta Informaticae - Program Transformation: Theoretical Foundations and Basic Techniques. Part 1
First and Second Order Recursion on Abstract Data Types
Fundamenta Informaticae
Knowledge-Based Asynchronous Programming
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Linear dependent types in a call-by-value scenario
Proceedings of the 14th symposium on Principles and practice of declarative programming
EQUATIONAL TERM GRAPH REWRITING
Fundamenta Informaticae
POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
| Hi-index | 0.02 |