Sciweavers

282 search results - page 48 / 57
» Verifying Commit-Atomicity Using Model-Checking
Sort
View
231
Voted
POPL
2008
ACM
16 years 2 months ago
Relevance heuristics for program analysis
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
Kenneth L. McMillan
INTERNET
2006
144views more  INTERNET 2006»
15 years 2 months ago
Analyzing Conversations of Web Services
A conversation is the global sequence of messages exchanged among the components of a distributed system. Conversations provide a promising model for specifying and analyzing the ...
Tevfik Bultan, Jianwen Su, Xiang Fu
KI
2006
Springer
15 years 2 months ago
Agent Logics as Program Logics: Grounding KARO
Abstract. Several options are available to relate agent logics to computational agent systems. Among others, one can try to find useful executable fragments of an agent logic or us...
Koen V. Hindriks, John-Jules Ch. Meyer
115
Voted
FTCS
1998
114views more  FTCS 1998»
15 years 3 months ago
Verification of a Safety-Critical Railway Interlocking System with Real-Time Constraints
Ensuring the correctness of computer systems used in lifecritical applications is very difficult. The most commonly used verification methods, simulation and testing, are not exha...
Vicky Hartonas-Garmhausen, Sérgio Vale Agui...
ATVA
2007
Springer
150views Hardware» more  ATVA 2007»
15 years 6 months ago
3-Valued Circuit SAT for STE with Automatic Refinement
Abstract. Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X n"), where t...
Orna Grumberg, Assaf Schuster, Avi Yadgar