Sciweavers

13 search results - page 2 / 3
» concur 1999
Sort
View
CONCUR
1999
Springer
13 years 11 months ago
Testing Concurrent Systems: A Formal Approach
This paper discusses the use of formal methods in testing of concurrent systems. It is argued that formal methods and testing can be mutually profitable and useful. A framework fo...
Jan Tretmans
CONCUR
1999
Springer
13 years 11 months ago
Object Types against Races
This paper investigates an approach for statically preventing race conditions in an object-oriented language. The setting of this work is a variant of Gordon and Hankin’s concurr...
Cormac Flanagan, Martín Abadi
CONCUR
1999
Springer
13 years 11 months ago
Validating Firewalls in Mobile Ambients
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
Flemming Nielson, Hanne Riis Nielson, René ...
CONCUR
1999
Springer
13 years 11 months ago
Statecharts Via Process Algebra
Statecharts is a visual language for specifying the behavior of reactive systems. The language extends nite-state machines with concepts of hierarchy, concurrency, and priority. De...
Gerald Lüttgen, Michael von der Beeck, Rance ...
CONCUR
1999
Springer
13 years 11 months ago
Partial Order Reduction for Model Checking of Timed Automata
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Marius Minea