Sciweavers

91 search results - page 10 / 19
» The Complete Proof Theory of Hybrid Systems
Sort
View
TYPES
1995
Springer
15 years 3 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan
JAR
2007
104views more  JAR 2007»
15 years 16 hour ago
Student Proof Exercises Using MathsTiles and Isabelle/HOL in an Intelligent Book
The Intelligent Book project aims to improve online education by designing materials that can model the subject matter they teach, in the manner of a Reactive Learning Environment...
William Billingsley, Peter Robinson
91
Voted
STACS
2001
Springer
15 years 4 months ago
A Logical Approach to Decidability of Hierarchies of Regular Star-Free Languages
We propose a new, logical, approach to the decidability problem for the Straubing and Brzozowski hierarchies based on the preservation theorems from model theory, on a theorem of ...
Victor L. Selivanov
103
Voted
PPDP
2009
Springer
15 years 6 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
88
Voted
FAC
1998
111views more  FAC 1998»
14 years 11 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