Sciweavers

1000 search results - page 140 / 200
» Nominal rewriting systems
Sort
View
SIGSOFT
2001
ACM
16 years 6 months ago
A graph based architectural (Re)configuration language
For several different reasons, such as changes in the business or technological environment, the configuration of a system may need to evolve during execution. Support for such ev...
Michel Wermelinger, Antónia Lopes, Jos&eacu...
CADE
2004
Springer
16 years 6 months ago
Using Automated Theorem Provers to Certify Auto-generated Aerospace Software
Abstract. We describe a system for the automated certification of safety properties of NASA software. The system uses Hoare-style program verification technology to generate proof ...
Bernd Fischer 0002, Ewen Denney, Johann Schumann
FROCOS
2007
Springer
15 years 12 months ago
Proving Termination Using Recursive Path Orders and SAT Solving
We introduce a propositional encoding of the recursive path order with status (RPO). RPO is a combination of a multiset path order and a lexicographic path order which considers pe...
Peter Schneider-Kamp, René Thiemann, Elena ...
RTA
2007
Springer
15 years 12 months ago
Intruders with Caps
In the analysis of cryptographic protocols, a treacherous set of terms is one from which an intruder can get access to what was intended to be secret, by adding on to the top of a ...
Siva Anantharaman, Paliath Narendran, Michaël...
BIRTHDAY
2005
Springer
15 years 11 months ago
Graph Transformation with Variables
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
Berthold Hoffmann