Sciweavers

3573 search results - page 181 / 715
» Reasoning about Codata
Sort
View
141
Voted
JSC
2000
117views more  JSC 2000»
15 years 3 months ago
Goals and Benchmarks for Automated Map Reasoning
Tarski-Givant's map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-pr...
Andrea Formisano, Eugenio G. Omodeo, Marco Temperi...
117
Voted
FAC
1998
111views more  FAC 1998»
15 years 3 months ago
A Formal Axiomatization for Alphabet Reasoning with Parametrized Processes
In the process-algebraic veri cation of systems with three or more components put in parallel, alphabet axioms are considered to be very useful. These are rules that exploit the i...
Henri Korver, M. P. A. Sellink
107
Voted
CADE
2008
Springer
16 years 3 months ago
Bitfields and Tagged Unions in C: Verification through Automatic Generation
We present a tool for automatic generation of packed bitfields and tagged unions for systems-level C, along with automatic, machine checked refinement proofs in Isabelle/HOL. Our a...
David Cock
CADE
2006
Springer
16 years 3 months ago
Partial Recursive Functions in Higher-Order Logic
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
Alexander Krauss
CADE
2006
Springer
16 years 3 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer