Sciweavers

7 search results - page 1 / 2
» A Formal Calculus for Informal Equality with Binding
Sort
View
WOLLIC
2007
Springer
13 years 11 months ago
A Formal Calculus for Informal Equality with Binding
Abstract. In informal mathematical usage we often reason using languages with binding. We usually find ourselves placing capture-avoidance constraints on where variables can and c...
Murdoch Gabbay, Aad Mathijssen
EMISA
2006
Springer
13 years 8 months ago
A Unified Formal Foundation for Service Oriented Architectures
: This paper summarizes how an algebra for mobile systems, the -calculus, can be applied as unified formal foundation to service oriented architectures (SOA). The concepts accounte...
Frank Puhlmann
CLEIEJ
2006
88views more  CLEIEJ 2006»
13 years 5 months ago
A Stochastic Concurrent Constraint Based Framework to Model and Verify Biological Systems
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
Carlos Olarte, Camilo Rueda
POPL
2008
ACM
14 years 5 months ago
Engineering formal metatheory
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
Arthur Charguéraud, Benjamin C. Pierce, Bri...
ENTCS
2002
97views more  ENTCS 2002»
13 years 4 months ago
Plan in Maude: Specifying an Active Network Programming Language
PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative funct...
Mark-Oliver Stehr, Carolyn L. Talcott