Sciweavers

273 search results - page 25 / 55
» A Compositional Semantics for Conditional Term Rewriting Sys...
Sort
View
LISP
2008
105views more  LISP 2008»
14 years 11 months ago
Proving operational termination of membership equational programs
Abstract Reasoning about the termination of equational programs in sophisticated equational languages such as ELAN, MAUDE, OBJ, CAFEOBJ, HASKELL, and so on, requires support for ad...
Francisco Durán, Salvador Lucas, Claude Mar...
CSL
1999
Springer
15 years 4 months ago
A Truly Concurrent Semantics for a Simple Parallel Programming Language
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
Paul Gastin, Michael W. Mislove
67
Voted
ATAL
2008
Springer
15 years 1 months ago
Model-checking agent refinement
We present a proof-technique for reducing the nondeterminbstract agent specifications in a BDI framework by means of refinement. We implement the operational semantics of agent sp...
Lacramioara Astefanoaei, Frank S. de Boer
DAGSTUHL
2006
15 years 1 months ago
A Framework for Analyzing Composition of Security Aspects
The methodology of aspect-oriented software engineering has been proposed to factor out concerns that are orthogonal to the core functionality of a system. In particular, this is a...
Jorge Fox, Jan Jürjens
ROOM
2000
15 years 1 months ago
Object-Oriented Refinement and Proof using Behaviour Functions
This paper proposes a new calculus for expressing the behaviour of object-oriented systems. The semantics of the calculus is given in terms of operators from computational categor...
Tony Clark