Lecture Notes in Computer Science - Computer-Aided Verification
Latest Publications

TOTAL DOCUMENTS

36

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer-Verlag

3540544771

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Automatic verification of extensions of hardware descriptions

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023714 ◽

2005 ◽

pp. 2-12 ◽

Author(s):

Hans Eveking

Keyword(s):

Automatic Verification

Download Full-text

Using partial-order semantics to avoid the state explosion problem in asynchronous systems

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023728 ◽

2005 ◽

pp. 146-155 ◽

Author(s):

David K. Probst ◽

Hon F. Li

Keyword(s):

Partial Order ◽

The State ◽

Asynchronous Systems ◽

State Explosion ◽

State Explosion Problem ◽

Partial Order Semantics

Download Full-text

Branching time regular temporal logic for model checking with linear time complexity

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023739 ◽

2005 ◽

pp. 253-262 ◽

Author(s):

Kiyoharu Hamaguchi ◽

Hiromi Hiraishi ◽

Shuzo Yajima

Keyword(s):

Model Checking ◽

Temporal Logic ◽

Time Complexity ◽

Linear Time ◽

Download Full-text

Quantitative temporal reasoning

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023727 ◽

2005 ◽

pp. 136-145 ◽

Author(s):

E. Allen Emerson ◽

A. K. Mok ◽

A. P. Sistla ◽

Jai Srinivasan

Keyword(s):

Temporal Reasoning

Download Full-text

On using protean to verify ISO FTAM protocol

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023726 ◽

2005 ◽

pp. 126-135

Author(s):

R. Lai ◽

K. R. Parker ◽

T. S. Dillon

Download Full-text

Using optimal simulations to reduce reachability graphs

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023730 ◽

2005 ◽

pp. 166-175 ◽

Author(s):

Ryszard Janicki ◽

Maciej Koutny

Download Full-text

A proof lattice-based technique for analyzing liveness of resource controllers

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023743 ◽

2005 ◽

pp. 292-301 ◽

Author(s):

Ugo Buy ◽

Robert Moll

Download Full-text

Memory efficient algorithms for the verification of temporal properties

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023737 ◽

2005 ◽

pp. 233-242 ◽

Author(s):

C. Courcoubetis ◽

M. Vardi ◽

P. Wolper ◽

M. Yannakakis

Keyword(s):

Efficient Algorithms ◽

Temporal Properties ◽

Memory Efficient

Download Full-text

Computer assistance for program refinement

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023745 ◽

2005 ◽

pp. 312-321

Author(s):

D. A. Carrington ◽

K. A. Robinson

Keyword(s):

Computer Assistance

Download Full-text

A unified approach to the deadlock detection problem in networks of communicating finite state machines

Lecture Notes in Computer Science - Computer-Aided Verification ◽

10.1007/bfb0023738 ◽

2005 ◽

pp. 243-252 ◽

Author(s):

Wuxu Peng ◽

S. Purushothaman

Keyword(s):

Finite State Machines ◽

State Machines ◽

Deadlock Detection ◽

Unified Approach ◽

Detection Problem ◽

Download Full-text