199 search results - page 28 / 40 » A Fully Abstract Model for Graph-Interpreted Temporal Logic |
91
Voted
CORR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL). We present several efficient encodings that have size linear in the bound. Furthe...
93
Voted
TACAS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. The methods of Invisible Invariants and Invisible Ranking were developed originally in order to verify temporal properties of parameterized systems in a fully automatic m...
117
click to vote
SPIN
2007
Springer
15 years 8 months ago
2007
Springer
d Abstract) Luboˇs Brim and Jiˇr´ı Barnat Faculty of Informatics, Masaryk University, Brno, Czech Republic With the increase in the complexity of computer systems, it becomes e...
117
click to vote
BIRTHDAY
2003
Springer
15 years 7 months ago
2003
Springer
One of the central axioms of extreme programming is the disciplined use of regression testing during stepwise software development. Due to recent progress in software model checkin...
131
click to vote
BIRTHDAY
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...