Sciweavers

49 search results - page 3 / 10
» Operational and Axiomatic Semantics of PCF
Sort
View
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 5 months ago
Mechanized semantics
The goal of this lecture is to show how modern theorem provers--in this case, the Coq proof assistant--can be used to mechanize the specification of programming languages and their...
Xavier Leroy
ENTCS
2007
97views more  ENTCS 2007»
13 years 5 months ago
Process Algebra Having Inherent Choice: Revised Semantics for Concurrent Systems
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
Harald Fecher, Heiko Schmidt
FUIN
2008
74views more  FUIN 2008»
13 years 5 months ago
A P Systems Flat Form Preserving Step-by-step Behaviour
Starting from a compositional operational semantics of transition P Systems we have previously defined, we face the problem of developing an axiomatization that is sound and comple...
Roberto Barbuti, Andrea Maggiolo-Schettini, Paolo ...
LORI
2009
Springer
14 years 11 days ago
Dynamic Context Logic
Building on a simple modal logic of context, the paper presents a dynamic logic characterizing operations of contraction and expansion on theories. We investigate the mathematical...
Guillaume Aucher, Davide Grossi, Andreas Herzig, E...
TPHOL
1994
IEEE
13 years 10 months ago
Trustworthy Tools for Trustworthy Programs: A Verified Verification Condition Generator
Verification Condition Generator (VCG) tools have been effective in simplifying the task of proving programs correct. However, in the past these VCG tools have in general not thems...
Peter V. Homeier, David F. Martin