Antti Valmari - RankMe

106 papers A* 3A 5B 16C 5Journal 36Unranked 40

Year	Rank	Type	Title / Venue / Authors
2022	—	`conf`	Adapting Formal Logic for Everyday Mathematics. CSEDU (2) Antti Valmari
2022	J	`jnl`	Partial-order reduction for parity games and parameterised Boolean equation systems. Int. J. Softw. Tools Technol. Transf. Thomas Neele, Tim A. C. Willemse, Wieger Wesselink, Antti Valmari
2021	J	`jnl`	A Completeness Proof for A Regular Predicate Logic with Undefined Truth Value. CoRR Antti Valmari, Lauri Hella
2021	J	`jnl`	A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. Log. Methods Comput. Sci. Thomas Neele, Antti Valmari, Tim A. C. Willemse
2021	—	`conf`	Automated Checking of Flexible Mathematical Reasoning in the Case of Systems of (In)Equations and the Absolute Value Operator. CSEDU (2) Antti Valmari
2021	J	`jnl`	Stubborn Sets, Frozen Actions, and Fair Testing. Fundam. Informaticae Antti Valmari, Walter Vogler
2020	J	`jnl`	A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR Thomas Neele, Antti Valmari, Tim A. C. Willemse
2020	J	`jnl`	All congruences below stability-preserving fair testing or CFFD. Acta Informatica Antti Valmari
2020	B	`conf`	The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. FoSSaCS Thomas Neele, Antti Valmari, Tim A. C. Willemse
2019	—	`conf`	Arithmetic, Logic, Syntax and MathCheck. CSEDU (2) Antti Valmari, Johanna Rantala
2019	J	`jnl`	The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction. CoRR Thomas Neele, Antti Valmari, Tim A. C. Willemse
2018	—	`conf`	Algorithms and Logic as Programming Primers. CSEDU (Selected Papers) Pia Niemelä, Antti Valmari, Simo Ali-Löytty
2018	—	`conf`	Elementary Math to Close the Digital Skills Gap. CSEDU (2) Pia Niemelä, Antti Valmari
2018	J	`jnl`	Fair testing and stubborn sets. Int. J. Softw. Tools Technol. Transf. Antti Valmari, Walter Vogler
2018	—	`conf`	Modelling Without a Modelling Language. SPIN Antti Valmari, Vesa Lappalainen
2018	C	`conf`	Progress Checking for Dummies. FMICS Antti Valmari, Henri Hansen
2017	—	`conf`	More Stubborn Set Methods for Process Algebras. Concurrency, Security, and Puzzles Antti Valmari
2017	J	`jnl`	Stop It, and Be Stubborn! ACM Trans. Embed. Comput. Syst. Antti Valmari
2017	J	`jnl`	Stubborn Set Intuition Explained. Trans. Petri Nets Other Model. Concurr. Antti Valmari, Henri Hansen
2017	—	`conf`	Stubborn Sets with Frozen Actions. RP Antti Valmari
2016	J	`jnl`	Constructing Minimal Coverability Sets. Fundam. Informaticae Artturi Piipponen, Antti Valmari
2016	—	`conf`	Fair Testing and Stubborn Sets. SPIN Antti Valmari, Walter Vogler
2016	J	`jnl`	Preface. Fundam. Informaticae Raymond Devillers, Antti Valmari, Wojciech Penczek
2016	—	`conf`	Safety Property-Driven Stubborn Sets. RP Henri Hansen, Antti Valmari
2016	—	`conf`	Stubborn Set Intuition Explained. PNSE @ Petri Nets Antti Valmari, Henri Hansen
2016	—	`conf`	The Congruences below Fair Testing with Initial Stability. ACSD Antti Valmari
2015	J	`jnl`	A State Space Tool for Models Expressed In C++ (tool paper). CoRR Antti Valmari
2015	—	`conf`	A state space tool for concurrent system models expressed in C++. SPLST Antti Valmari
2015	B	`ed.`	Application and Theory of Petri Nets and Concurrency - 36th International Conference, PETRI NETS 2015, Brussels, Belgium, June 21-26, 2015, Proceedings Petri Nets Raymond Devillers, Antti Valmari
2015	J	`jnl`	On constructibility and unconstructibility of LTS operators from other LTS operators. Acta Informatica Antti Valmari
2015	—	`conf`	Priority queue classes with priority update. SPLST Matti Rintala, Antti Valmari
2015	—	`conf`	Stop It, and Be Stubborn! ACSD Antti Valmari
2015	J	`jnl`	Stop It, and Be Stubborn! CoRR Antti Valmari
2014	J	`jnl`	Asymptotic Proportion of Hard Instances of the Halting Problem. Acta Cybern. Antti Valmari
2014	—	`conf`	Character Strings and Gödel's Incompleteness Proof. AFL Antti Valmari
2014	J	`jnl`	Old and New Algorithms for Minimal Coverability Sets. Fundam. Informaticae Antti Valmari, Henri Hansen
2013	J	`jnl`	All Linear-Time Congruences for Familiar Operators. Log. Methods Comput. Sci. Antti Valmari
2013	—	`conf`	Constructing Minimal Coverability Sets. RP Artturi Piipponen, Antti Valmari
2013	J	`jnl`	External Behaviour of Systems of State Machines with Variables. Trans. Petri Nets Other Model. Concurr. Antti Valmari
2013	J	`jnl`	Good to Know about the Efficiency of State Space Methods. Nord. J. Comput. Mikko Tiusanen, Antti Valmari
2013	J	`jnl`	The Asymptotic Behaviour of the Proportion of Hard Instances of the Halting Problem (Extended Version). CoRR Antti Valmari
2012	B	`conf`	All Linear-Time Congruences for Familiar Operators Part 2: Infinite LTSs. CONCUR Antti Valmari
2012	—	`conf`	All Linear-Time Congruences for Finite LTSs and Familiar Operators. ACSD Antti Valmari
2012	J	`jnl`	Fast brief practical DFA minimization. Inf. Process. Lett. Antti Valmari
2012	B	`conf`	Old and New Algorithms for Minimal Coverability Sets. Petri Nets Antti Valmari, Henri Hansen
2011	J	`jnl`	Can Stubborn Sets Be Optimal? Fundam. Informaticae Antti Valmari, Henri Hansen
2010	B	`conf`	Can Stubborn Sets Be Optimal? Petri Nets Antti Valmari, Henri Hansen
2010	A	`conf`	Simple TACAS Antti Valmari, Giuliana Franceschinis
2010	J	`jnl`	Simple Bisimilarity Minimization in O(m log n) Time. Fundam. Informaticae Antti Valmari
2009	B	`conf`	Bisimilarity Minimization in O(m logn) Time. Petri Nets Antti Valmari
2009	B	`conf`	Exploring the Scope for Partial Order Reduction. ATVA Jaco Geldenhuys, Henri Hansen, Antti Valmari
2009	J	`jnl`	Software model checking is a rich research field. Int. J. Softw. Tools Technol. Transf. Antti Valmari
2008	J	`jnl`	Efficient Minimization of DFAs with Partial Transition Functions CoRR Antti Valmari, Petri Lehtinen
2008	A	`conf`	Efficient Minimization of DFAs with Partial Transition. STACS Antti Valmari, Petri Lehtinen
2008	—	`conf`	Synthesizing Test Models from Test Cases. Haifa Verification Conference Antti Jääskeläinen, Antti Kervinen, Mika Katara, Antti Valmari, Heikki Virtanen
2006	—	`ed.`	Model Checking Software, 13th International SPIN Workshop, Vienna, Austria, March 30 - April 1, 2006, Proceedings SPIN Antti Valmari
2006	B	`conf`	Operational Determinism and Fast Algorithms. CONCUR Henri Hansen, Antti Valmari
2006	J	`jnl`	Question-guided stubborn set methods for state properties. Formal Methods Syst. Des. Lars Michael Kristensen, Karsten Schmidt, Antti Valmari
2006	J	`jnl`	What the small Rubik's cube taught me about data structures, information theory, and randomisation. Int. J. Softw. Tools Technol. Transf. Antti Valmari
2005	—	`conf`	A Method for Analysing the Performance of Certain Testing Techniques for Concurrent Systems. ACSD Timo Kellomäki, Antti Valmari
2005	J	`jnl`	More efficient on-the-fly LTL verification with Tarjan's algorithm. Theor. Comput. Sci. Jaco Geldenhuys, Antti Valmari
2004	A	`conf`	Tampere Verification Tool. TACAS Heikki Virtanen, Henri Hansen, Antti Valmari, Juha Nieminen, Timo Erkkilä
2004	A	`conf`	Tarjan's Algorithm Makes On-the-Fly LTL Verification More Efficient. TACAS Jaco Geldenhuys, Antti Valmari
2003	—	`conf`	A Nearly Memory-Optimal Data Structure for Sets and Mappings. SPIN Jaco Geldenhuys, Antti Valmari
2003	—	`conf`	Merging State-Based and Action-Based Verification. ACSD Henri Hansen, Heikki Virtanen, Antti Valmari
2003	C	`conf`	Verification with the Undefined: A New Look. FMICS Antero Kangas, Antti Valmari
2002	B	`conf`	Alphabet-Based Synchronisation is Exponentially Cheaper. CONCUR Antti Valmari, Antti Kervinen
2002	C	`conf`	Context-Sensitive Visibility. FMICS Antti Valmari, Heikki Virtanen, Antti Puhakka
2002	C	`conf`	Stuttering-Insensitive Automata for On-the-fly Detection of Livelock Properties. FMICS Henri Hansen, Wojciech Penczek, Antti Valmari
2001	B	`conf`	Liveness and Fairness in Process-Algebraic Verification. CONCUR Antti Puhakka, Antti Valmari
2001	J	`jnl`	Relaxed Visibility Enhances Partial Order Reduction. Formal Methods Syst. Des. Doron A. Peled, Antti Valmari, Ilkka Kokkarinen
2001	B	`conf`	Techniques for Smaller Intermediary BDDs. CONCUR Jaco Geldenhuys, Antti Valmari
2000	A	`conf`	Checking for CFFD-Preorder with Tester Processes. TACAS Juhana Helovuo, Antti Valmari
2000	—	`conf`	Composition and Abstraction. MOVEP Antti Valmari
2000	—	`conf`	Improved Question-Guided Stubborn Set Methods for State Properties. ICATPN Lars Michael Kristensen, Antti Valmari
2000	—	`conf`	Reduction factors in finite automata with application to nonlinear filters. EUSIPCO Antti Niemistö, Olli Yli-Harja, Antti Valmari, Pertti Koivisto, Ilya Shmulevich
1999	B	`conf`	Weakest-Congruence Results for Livelock-Preserving Equivalences. CONCUR Antti Puhakka, Antti Valmari
1998	—	`conf`	Finding Stubborn Sets of Coloured Petri Nets Without Unfolding. ICATPN Lars Michael Kristensen, Antti Valmari
1998	—	`conf`	Unbounded Verification Results by Finite-State Compositional Techniques: 10 ACSD Antti Valmari, Ilkka Kokkarinen
1997	J	`jnl`	Essential Transitions to Bisimulation Equivalences. Theor. Comput. Sci. Jaana Eloranta, Martti Tienari, Antti Valmari
1997	A*	`conf`	Relaxed Visibility Enhances Partial Order Reduction. CAV Ilkka Kokkarinen, Doron A. Peled, Antti Valmari
1996	—	`conf`	Compositionality in State Space Verification Methods. Application and Theory of Petri Nets Antti Valmari
1996	—	`conf`	Stubborn set methods for process algebras. Partial Order Methods in Verification Antti Valmari
1996	B	`conf`	The State Explosion Problem. Petri Nets Antti Valmari
1996	—	`conf`	Verification-Driven Development of a Collision-Avoidance Protocol for the Ethernet. FTRTFT Konsta Karsisto, Antti Valmari
1996	—	`conf`	Visual Verification of Safety and Liveness. FME Antti Valmari, Manu Setälä
1996	C	`conf`	Visualisation of Reduced Abstracted Behaviour as a Design Tool. PDP Antti Valmari, Konsta Karsisto, Manu Setälä
1995	J	`jnl`	Compositional Failure-based Semantics Models for Basic LOTOS. Formal Aspects Comput. Antti Valmari, Martti Tienari
1995	—	`conf`	Failure-based Equivalences Are Faster Than Many Believe. STRICT Antti Valmari
1995	J	`jnl`	The Weakest Deadlock-Preserving Congruence. Inf. Process. Lett. Antti Valmari
1994	—	`conf`	Compositional Analysis with Place-Bordered Subnets. Application and Theory of Petri Nets Antti Valmari
1993	A*	`conf`	On-the-Fly Verification with Stubborn Sets. CAV Antti Valmari
1993	—	`conf`	Putting Advanced Reachability Analysis Techniques Together: the "ARA" Tool. FME Antti Valmari, Jukka Kemppainen, Matthew Clegg, Mikko Levanto
1992	J	`jnl`	A Stubborn Attack on State Explosion. Formal Methods Syst. Des. Antti Valmari
1992	B	`conf`	The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. CONCUR Roope Kaivola, Antti Valmari
1991	—	`conf`	An Improved Failures Equivalence for Finite-State Systems with a Reduction Algorithm. PSTV Antti Valmari, Martti Tienari
1991	—	`conf`	Compositional State Space Generation. Applications and Theory of Petri Nets Antti Valmari
1991	B	`conf`	Reduced Labelled Transition Systems Save Verification Effort. CONCUR Antti Valmari, Matthew Clegg
1991	B	`conf`	Using Truth-Preserving Reductions to Improve the Clarity of Kripke-Models. CONCUR Roope Kaivola, Antti Valmari
1990	A*	`conf`	A Stubborn Attack On State Explosion. CAV Antti Valmari
1990	—	`conf`	A Stubborn Attack on State Explosion. CAV (DIMACS/AMS volume) Antti Valmari
1989	—	`conf`	Eliminating Redundant Interleavings During Concurrent Program Verification. PARLE (2) Antti Valmari
1989	—	`conf`	State Space Generation with Induction. SCAI Antti Valmari
1989	—	`conf`	Stubborn sets for reduced state space generation. Applications and Theory of Petri Nets Antti Valmari
1988	J	`jnl`	PC-Rimst - a tool for validating concurrent program designs. Microprocess. Microprogramming Antti Valmari
1987	J	`jnl`	Reachability analysis -based validation of embedded systems. Microprocess. Microprogramming Antti Valmari