 | 2009 |
|---|
| 51 |       | Jaco Geldenhuys,
Henri Hansen,
Antti Valmari:
Exploring the Scope for Partial Order Reduction.
ATVA 2009: 39-53 |
| 50 | | Antti Valmari:
Bisimilarity Minimization in O(m logn) Time.
Petri Nets 2009: 123-142 |
| 49 | | Antti Valmari:
Software model checking is a rich research field.
STTT 11(1): 1-11 (2009) |
| 2008 |
|---|
| 48 | | Antti Jääskeläinen,
Antti Kervinen,
Mika Katara,
Antti Valmari,
Heikki Virtanen:
Synthesizing Test Models from Test Cases.
Haifa Verification Conference 2008: 179-193 |
| 47 | | Antti Valmari,
Petri Lehtinen:
Efficient Minimization of DFAs with Partial Transition.
STACS 2008: 645-656 |
| 46 | | Antti Valmari,
Petri Lehtinen:
Efficient Minimization of DFAs with Partial Transition Functions
CoRR abs/0802.2826: (2008) |
| 2006 |
|---|
| 45 |  | Antti Valmari:
Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings
Springer 2006 |
| 44 | | Henri Hansen,
Antti Valmari:
Operational Determinism and Fast Algorithms.
CONCUR 2006: 188-202 |
| 43 | | Lars Michael Kristensen,
K. Schmidt,
Antti Valmari:
Question-guided stubborn set methods for state properties.
Formal Methods in System Design 29(3): 215-251 (2006) |
| 42 | | Antti Valmari:
What the small Rubik's cube taught me about data structures, information theory, and randomisation.
STTT 8(3): 180-194 (2006) |
| 2005 |
|---|
| 41 | | Timo Kellomaki,
Antti Valmari:
A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems.
ACSD 2005: 154-163 |
| 40 | | Jaco Geldenhuys,
Antti Valmari:
More efficient on-the-fly LTL verification with Tarjan's algorithm.
Theor. Comput. Sci. 345(1): 60-82 (2005) |
| 2004 |
|---|
| 39 | | Heikki Virtanen,
Henri Hansen,
Antti Valmari,
Juha Nieminen,
Timo Erkkilä:
Tampere Verification Tool.
TACAS 2004: 153-157 |
| 38 | | Jaco Geldenhuys,
Antti Valmari:
Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient.
TACAS 2004: 205-219 |
| 2003 |
|---|
| 37 | | Henri Hansen,
Heikki Virtanen,
Antti Valmari:
Merging State-Based and Action-Based Verification.
ACSD 2003: 150-156 |
| 36 | | Jaco Geldenhuys,
Antti Valmari:
A Nearly Memory-Optimal Data Structure for Sets and Mappings.
SPIN 2003: 136-150 |
| 35 | | Antero Kangas,
Antti Valmari:
Verification with the Undefined: A New Look.
Electr. Notes Theor. Comput. Sci. 80: (2003) |
| 2002 |
|---|
| 34 | | Antti Valmari,
Antti Kervinen:
Alphabet-Based Synchronisation is Exponentially Cheaper.
CONCUR 2002: 161-176 |
| 33 | | Antti Valmari,
Heikki Virtanen,
Antti Puhakka:
Context-Sensitive Visibility.
Electr. Notes Theor. Comput. Sci. 66(2): (2002) |
| 32 | | Henri Hansen,
Wojciech Penczek,
Antti Valmari:
Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties.
Electr. Notes Theor. Comput. Sci. 66(2): (2002) |
| 2001 |
|---|
| 31 | | Antti Puhakka,
Antti Valmari:
Liveness and Fairness in Process-Algebraic Verification.
CONCUR 2001: 202-217 |
| 30 | | Jaco Geldenhuys,
Antti Valmari:
Techniques for Smaller Intermediary BDDs.
CONCUR 2001: 233-247 |
| 29 | | Doron Peled,
Antti Valmari,
Ilkka Kokkarinen:
Relaxed Visibility Enhances Partial Order Reduction.
Formal Methods in System Design 19(3): 275-289 (2001) |
| 2000 |
|---|
| 28 | | Lars Michael Kristensen,
Antti Valmari:
Improved Question-Guided Stubborn Set Methods for State Properties.
ICATPN 2000: 282-302 |
| 27 | | Antti Valmari:
Composition and Abstraction.
MOVEP 2000: 58-98 |
| 26 | | Juhana Helovuo,
Antti Valmari:
Checking for CFFD-Preorder with Tester Processes.
TACAS 2000: 283-298 |
| 1999 |
|---|
| 25 | | Antti Puhakka,
Antti Valmari:
Weakest-Congruence Results for Livelock-Preserving Equivalences.
CONCUR 1999: 510-524 |
| 1998 |
|---|
| 24 | | Antti Valmari,
Ilkka Kokkarinen:
Unbounded Verification Results by Finite-State Compositional Techniques: 10any States and Beyond.
ACSD 1998: 75- |
| 23 | | Lars Michael Kristensen,
Antti Valmari:
Finding Stubborn Sets of Coloured Petri Nets Without Unfolding.
ICATPN 1998: 104-123 |
| 1997 |
|---|
| 22 | | Ilkka Kokkarinen,
Doron Peled,
Antti Valmari:
Relaxed Visibility Enhances Partial Order Reduction.
CAV 1997: 328-339 |
| 21 | | Jaana Eloranta,
Martti Tienari,
Antti Valmari:
Essential Transitions to Bisimulation Equivalences.
Theor. Comput. Sci. 179(1-2): 397-419 (1997) |
| 1996 |
|---|
| 20 | | Antti Valmari:
Compositionality in State Space Verification Methods.
Application and Theory of Petri Nets 1996: 29-56 |
| 19 | | Antti Valmari,
Manu Setälä:
Visual Verification of Safety and Liveness.
FME 1996: 228-247 |
| 18 | | Konsta Karsisto,
Antti Valmari:
Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet.
FTRTFT 1996: 228-245 |
| 17 | | Antti Valmari,
Konsta Karsisto,
Manu Setälä:
Visualisation of Reduced Abstracted Behaviour as a Design Tool.
PDP 1996: 187-195 |
| 16 | | Antti Valmari:
The State Explosion Problem.
Petri Nets 1996: 429-528 |
| 1995 |
|---|
| 15 | | Antti Valmari,
Martti Tienari:
Compositional Failure-based Semantics Models for Basic LOTOS.
Formal Asp. Comput. 7(4): 440-468 (1995) |
| 14 | | Antti Valmari:
The Weakest Deadlock-Preserving Congruence.
Inf. Process. Lett. 53(6): 341-346 (1995) |
| 1994 |
|---|
| 13 | | Antti Valmari:
Compositional Analysis with Place-Bordered Subnets.
Application and Theory of Petri Nets 1994: 531-547 |
| 1993 |
|---|
| 12 | | Antti Valmari:
On-the-Fly Verification with Stubborn Sets.
CAV 1993: 397-408 |
| 11 | | Antti Valmari,
Jukka Kemppainen,
Matthew Clegg,
Mikko Levanto:
Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool.
FME 1993: 597-616 |
| 1992 |
|---|
| 10 | | Roope Kaivola,
Antti Valmari:
The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic.
CONCUR 1992: 207-221 |
| 9 | | Antti Valmari:
A Stubborn Attack on State Explosion.
Formal Methods in System Design 1(4): 297-322 (1992) |
| 1991 |
|---|
| 8 | | Antti Valmari:
Compositional State Space Generation.
Applications and Theory of Petri Nets 1991: 427-457 |
| 7 | | Roope Kaivola,
Antti Valmari:
Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models.
CONCUR 1991: 361-375 |
| 6 | | Antti Valmari,
Matthew Clegg:
Reduced Labelled Transition Systems Save Verification Effort.
CONCUR 1991: 526-540 |
| 5 | | Antti Valmari,
Martti Tienari:
An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm.
PSTV 1991: 3-18 |
| 1990 |
|---|
| 4 | | Antti Valmari:
A Stubborn Attack On State Explosion.
CAV 1990: 156-165 |
| 1989 |
|---|
| 3 | | Antti Valmari:
Stubborn sets for reduced state space generation.
Applications and Theory of Petri Nets 1989: 491-515 |
| 2 | | Antti Valmari:
Eliminating Redundant Interleavings During Concurrent Program Verification.
PARLE (2) 1989: 89-103 |
| 1 | | Antti Valmari:
State Space Generation with Induction.
SCAI 1989: 99-115 |
