3909 search results - page 684 / 782 » Extreme Model Checking |
ACSAC
2000
IEEE
14 years 3 months ago
2000
IEEE
This contribution discusses a network-level access control technique that applies the non-discretionary access control model to individual data packets that are exchanged between ...
LICS
2000
IEEE
14 years 3 months ago
2000
IEEE
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
SIGSOFT
2000
ACM
14 years 3 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
CAV
2000
Springer
14 years 3 months ago
2000
Springer
Abstract. Any formalmethodor tool is almostcertainlymoreoftenapplied in situationswheretheoutcomeis failure(acounterexample)rather than success (a correctness proof). We present a ...
DATE
1999
IEEE
14 years 3 months ago
1999
IEEE
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...