Sciweavers

397 search results - page 65 / 80
» The lambda calculus is algebraic
Sort
View
CSL
2004
Springer
15 years 2 months ago
Predicate Transformers and Linear Logic: Yet Another Denotational Model
In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Pierre Hyvernat
CMSB
2008
Springer
14 years 11 months ago
Compositional Definitions of Minimal Flows in Petri Nets
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...
Michael Pedersen
ENTCS
2008
125views more  ENTCS 2008»
14 years 9 months ago
Can Refinement be Automated?
We automatically verify Back's atomicity refinement law and a classical data refinement law for action systems. Our novel approach mechanises a refinement calculus based on K...
Peter Höfner, Georg Struth
MPC
2010
Springer
152views Mathematics» more  MPC 2010»
15 years 2 months ago
Lucy-n: a n-Synchronous Extension of Lustre
Synchronous functional languages such as Lustre or Lucid Synchrone define a restricted class of Kahn Process Networks which can be executed with no buffer. Every expression is as...
Louis Mandel, Florence Plateau, Marc Pouzet
KI
2010
Springer
14 years 4 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer