Result 1 to 20 of 28 total
Saving space in a time efficient simulation algorithm. (English)
Fundam. Inform. 108, No. 1-2, 23-42 (2011).
1
An efficient simulation algorithm based on abstract interpretation. (English)
Inf. Comput. 208, No. 1, 1-22 (2010).
2
Computing stuttering simulations. (English)
Comput. Res. Repos. 2009, Article No. 0904.1488 (2009).
3
Computing stuttering simulations. (English)
Bravetti, Mario (ed.) et al., CONCUR 2009 ‒ concurrency theory. 20th international conference, CONCUR 2009, Bologna, Italy, September 1‒4, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04080-1/pbk). Lecture Notes in Computer Science 5710, 542-556 (2009).
4
The subgraph similarity problem (English)
IEEE Trans. Knowl. Data Eng. 21, No. 5, 748-749 (2009).
5
Computing stuttering simulations (English)
CONCUR, 542-556 (2009).
6
Saving space in a time efficient simulation algorithm (English)
ACSD, 60-69 (2009).
7
Generalizing the Paige-Tarjan algorithm by abstract interpretation. (English)
Inf. Comput. 206, No. 5, 620-651 (2008).
8
A forward-backward abstraction refinement algorithm. (English)
Logozzo, Francesco (ed.) et al., Verification, model checking, and abstract interpretation. 9th international conference, VMCAI 2008, San Francisco, USA, January 7‒9, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78162-2/pbk). Lecture Notes in Computer Science 4905, 248-262 (2008).
9
A forward-backward abstraction refinement algorithm (English)
VMCAI, 248-262 (2008).
10
An efficient simulation equivalence algorithm based on abstract interpretation. (English)
Comput. Res. Repos. 2007, Article No. 0709.4118 (2007).
11
Symbolic fault tree analysis for reactive systems. (English)
Namjoshi, Kedar S. (ed.) et al., Automated technology for verification and analysis. 5th international symposium, ATVA 2007 Tokyo, Japan, October 22‒25, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-75595-1/pbk). Lecture Notes in Computer Science 4762, 162-176 (2007).
12
Generalized strong preservation by abstract interpretation. (English)
J. Log. Comput. 17, No. 1, 157-197 (2007).
13
Symbolic fault tree analysis for reactive systems (English)
ATVA, 162-176 (2007).
14
A new efficient simulation equivalence algorithm (English)
LICS, 171-180 (2007).
15
Generalizing the paige-tarjan algorithm by abstract interpretation. (English)
Comput. Res. Repos. 2006, Article No. 0612120 (2006).
16
Strong preservation of temporal fixpoint-based operators by abstract interpretation. (English)
Emerson, E. Allen (ed.) et al., Verification, model checking, and abstract interpretation. 7th international conference, VMCAI 2006, Charleston, SC, USA, January 8‒10, 2006. Proceedings. Berlin: Springer (ISBN 3-540-31139-4/pbk). Lecture Notes in Computer Science 3855, 332-347 (2006).
17
Strong preservation of temporal fixpoint-based operators by abstract interpretation (English)
VMCAI, 332-347 (2006).
18
An abstract interpretation perspective on linear vs. branching time. (English)
Yi, Kwangkeun (ed.), Programming languages and systems. Third Asian symposium, APLAS 2005, Tsukuba, Japan, November 2‒5, 2005. Proceedings. Berlin: Springer (ISBN 3-540-29735-9/pbk). Lecture Notes in Computer Science 3780, 69-85 (2005).
19
An abstract interpretation-based refinement algorithm for strong preservation. (English)
Halbwachs, Nicolas (ed.) et al., Tools and algorithms for the construction and analysis of systems. 11th international conference, TACAS 2005, held as part of the joint European conference on theory and practice of software, ETAPS 2005, Edinburgh, UK, April 4‒8, 2005. Proceedings. Berlin: Springer (ISBN 3-540-25333-5/pbk). Lecture Notes in Computer Science 3440, 140-156 (2005).
20
Result 1 to 20 of 28 total
Start
Contact
Print
General Help
