Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntti Eero Johannes Hyvärinen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2011
[b1]Antti Eero Johannes Hyvärinen:
Grid based propositional satisfiability solving. Aalto University, Helsinki, Finland, 2011
Journal Articles
- 2023
- [j6]Rodrigo Otoni
, Matteo Marescotti, Leonardo Alt, Patrick Eugster, Antti E. J. Hyvärinen, Natasha Sharygina:
A Solicitous Approach to Smart Contract Verification. ACM Trans. Priv. Secur. 26(2): 15:1-15:28 (2023) - 2022
- [j5]Sepideh Asadi, Martin Blicha, Antti E. J. Hyvärinen, Grigory Fedyukovich, Natasha Sharygina:
SMT-based verification of program changes through summary repair. Formal Methods Syst. Des. 60(3): 350-380 (2022) - [j4]Martin Blicha, Antti E. J. Hyvärinen, Jan Kofron, Natasha Sharygina:
Using linear algebra in decomposition of Farkas interpolants. Int. J. Softw. Tools Technol. Transf. 24(1): 111-125 (2022) - 2019
- [j3]Pavel Jancík, Jan Kofron, Leonardo Alt, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
Exploiting partial variable assignment in interpolation-based model checking. Formal Methods Syst. Des. 55(1): 33-71 (2019) - 2011
- [j2]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. Fundam. Informaticae 107(2-3): 289-311 (2011) - 2009
- [j1]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Incorporating Clause Learning in Grid-Based Randomized SAT Solving. J. Satisf. Boolean Model. Comput. 6(4): 223-244 (2009)
Conference and Workshop Papers
- 2022
- [c41]Leonardo Alt, Martin Blicha, Antti E. J. Hyvärinen, Natasha Sharygina:
SolCMC: Solidity Compiler's Model Checker. CAV (1) 2022: 325-338 - [c40]Martin Blicha, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
Split Transition Power Abstraction for Unbounded Safety. FMCAD 2022: 349-358 - [c39]Martin Blicha, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
Transition Power Abstractions for Deep Counterexample Detection. TACAS (1) 2022: 524-542 - 2021
- [c38]Rodrigo Otoni, Martin Blicha, Patrick Eugster, Antti E. J. Hyvärinen, Natasha Sharygina:
Theory-Specific Proof Steps Witnessing Correctness of SMT Executions. DAC 2021: 541-546 - [c37]Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina:
Lookahead in Partitioning SMT. FMCAD 2021: 271-279 - 2020
- [c36]Sepideh Asadi, Martin Blicha, Antti E. J. Hyvärinen, Grigory Fedyukovich, Natasha Sharygina:
Incremental Verification by SMT-based Summary Repair. FMCAD 2020: 77-82 - [c35]Matteo Marescotti, Rodrigo Otoni, Leonardo Alt, Patrick Eugster, Antti E. J. Hyvärinen, Natasha Sharygina:
Accurate Smart Contract Verification Through Direct Modelling. ISoLA (3) 2020: 178-194 - [c34]Sepideh Asadi, Martin Blicha, Antti E. J. Hyvärinen, Grigory Fedyukovich, Natasha Sharygina:
Farkas-Based Tree Interpolation. SAS 2020: 357-379 - [c33]Martin Blicha, Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina:
A Cooperative Parallelization Approach for Property-Directed k-Induction. VMCAI 2020: 270-292 - 2019
- [c32]Karine Even-Mendoza, Antti E. J. Hyvärinen, Hana Chockler, Natasha Sharygina:
Lattice-based SMT for program verification. MEMOCODE 2019: 16:1-16:11 - [c31]Martin Blicha, Antti E. J. Hyvärinen, Jan Kofron, Natasha Sharygina:
Decomposing Farkas Interpolants. TACAS (1) 2019: 3-20 - 2018
- [c30]Matteo Marescotti, Martin Blicha, Antti E. J. Hyvärinen, Sepideh Asadi, Natasha Sharygina:
Computing Exact Worst-Case Gas Consumption for Smart Contracts. ISoLA (4) 2018: 450-465 - [c29]Sepideh Asadi, Martin Blicha, Grigory Fedyukovich, Antti E. J. Hyvärinen, Karine Even-Mendoza, Natasha Sharygina, Hana Chockler:
Function Summarization Modulo Theories. LPAR 2018: 56-75 - [c28]Antti E. J. Hyvärinen, Matteo Marescotti, Parvin Sadigova, Hana Chockler, Natasha Sharygina:
Lookahead-Based SMT Solving. LPAR 2018: 418-434 - [c27]Matteo Marescotti, Antti E. J. Hyvärinen, Natasha Sharygina:
SMTS: Distributed, Visualized Constraint Solving. LPAR 2018: 534-542 - [c26]Karine Even-Mendoza, Sepideh Asadi, Antti E. J. Hyvärinen, Hana Chockler, Natasha Sharygina:
Lattice-Based Refinement in Bounded Model Checking. VSTTE 2018: 50-68 - 2017
- [c25]Leonardo Alt, Antti Eero Johannes Hyvärinen, Sepideh Asadi, Natasha Sharygina:
Duality-based interpolation for quantifier-free equalities and uninterpreted functions. FMCAD 2017: 39-46 - [c24]Matteo Marescotti, Arie Gurfinkel, Antti Eero Johannes Hyvärinen, Natasha Sharygina:
Designing parallel PDR. FMCAD 2017: 156-163 - [c23]Leonardo Alt, Antti E. J. Hyvärinen, Natasha Sharygina:
LRA Interpolants from No Man's Land. Haifa Verification Conference 2017: 195-210 - [c22]Antti E. J. Hyvärinen, Sepideh Asadi, Karine Even-Mendoza, Grigory Fedyukovich, Hana Chockler, Natasha Sharygina:
Theory Refinement for Program Verification. SAT 2017: 347-363 - [c21]Jelena Budakovic, Matteo Marescotti, Antti E. J. Hyvärinen, Natasha Sharygina:
Visualising SMT-Based Parallel Constraint Solving. SMT 2017: 40-49 - [c20]Leonardo Alt, Sepideh Asadi, Hana Chockler, Karine Even-Mendoza, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
HiFrog: SMT-based Function Summarization for Software Verification. TACAS (2) 2017: 207-213 - 2016
- [c19]Matteo Marescotti, Antti E. J. Hyvärinen, Natasha Sharygina:
Clause Sharing and Partitioning for Cloud-Based SMT Solving. ATVA 2016: 428-443 - [c18]Pavel Jancík, Leonardo Alt, Grigory Fedyukovich, Antti E. J. Hyvärinen, Jan Kofron, Natasha Sharygina:
PVAIR: Partial Variable Assignment InterpolatoR. FASE 2016: 419-434 - [c17]Antti E. J. Hyvärinen, Matteo Marescotti, Leonardo Alt, Natasha Sharygina:
OpenSMT2: An SMT Solver for Multi-core and Cloud Computing. SAT 2016: 547-553 - 2015
- [c16]Grigory Fedyukovich, Andrea Callia D'Iddio, Antti E. J. Hyvärinen, Natasha Sharygina:
Symbolic Detection of Assertion Dependencies for Bounded Model Checking. FASE 2015: 186-201 - [c15]Antti E. J. Hyvärinen, Leonardo Alt, Natasha Sharygina:
Flexible Interpolation for Efficient Model Checking. MEMICS 2015: 11-22 - [c14]Antti E. J. Hyvärinen, Matteo Marescotti, Natasha Sharygina:
Search-Space Partitioning for Parallelizing SMT Solvers. SAT 2015: 369-386 - [c13]Leonardo Alt, Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
A Proof-Sensitive Approach for Small Propositional Interpolants. VSTTE 2015: 1-18 - 2014
- [c12]Fabrizio Pastore, Leonardo Mariani, Antti Eero Johannes Hyvärinen, Grigory Fedyukovich, Natasha Sharygina, Stephan Sehestedt, Ali Muhammad:
Verification-aided regression testing. ISSTA 2014: 37-48 - 2013
- [c11]Hana Chockler, Giovanni Denaro, Meijia Ling, Grigory Fedyukovich, Antti Eero Johannes Hyvärinen, Leonardo Mariani, Ali Muhammad, Manuel Oriol, Ajitha Rajan, Ondrej Sery, Natasha Sharygina, Michael Tautschnig:
PINCETTE - Validating Changes and Upgrades in Networked Software. CSMR 2013: 461-464 - [c10]Grigory Fedyukovich, Antti E. J. Hyvärinen, Natasha Sharygina:
Interpolation-based model checking for efficient incremental analysis of software. DDECS 2013: 8-9 - [c9]Simone Fulvio Rollini, Leonardo Alt, Grigory Fedyukovich, Antti Eero Johannes Hyvärinen, Natasha Sharygina:
PeRIPLO: A Framework for Producing Effective Interpolants in SAT-Based Software Verification. LPAR 2013: 683-693 - 2012
- [c8]Antti Eero Johannes Hyvärinen, Norbert Manthey:
Designing Scalable Parallel SAT Solvers. SAT 2012: 214-227 - 2011
- [c7]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning. CP 2011: 385-399 - 2010
- [c6]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning SAT Instances for Distributed Solving. LPAR (Yogyakarta) 2010: 372-386 - 2009
- [c5]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Partitioning Search Spaces of a Randomized Search. AI*IA 2009: 243-252 - 2008
- [c4]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Incorporating Learning in Grid-Based Randomized SAT Solving. AIMSA 2008: 247-261 - [c3]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
Strategies for Solving SAT in Grids by Randomized Search. AISC/MKM/Calculemus 2008: 125-140 - [c2]Mikko Juhani Pitkänen, Xin Zhou, Antti Eero Johannes Hyvärinen, Henning Müller:
Using the Grid for Enhancing the Performance of a Medical Image Search Engine. CBMS 2008: 367-372 - 2006
- [c1]Antti Eero Johannes Hyvärinen, Tommi A. Junttila, Ilkka Niemelä:
A Distribution Method for Solving SAT in Grids. SAT 2006: 430-435
Parts in Books or Collections
- 2018
- [p3]Antti E. J. Hyvärinen, Christoph M. Wintersteiger:
Parallel Satisfiability Modulo Theories. Handbook of Parallel Constraint Reasoning 2018: 141-178 - 2015
- [p2]Simone Fulvio Rollini, Leonardo Alt, Grigory Fedyukovich, Antti Eero Johannes Hyvärinen, Natasha Sharygina:
Optimizing Function Summaries Through Interpolation. Validation of Evolving Software 2015: 73-82 - [p1]Fabrizio Pastore, Leonardo Mariani, Antti Eero Johannes Hyvärinen, Grigory Fedyukovich, Natasha Sharygina, Stephan Sehestedt, Ali Muhammad:
Regression Checking of Changes in C Software. Validation of Evolving Software 2015: 185-207
Editorship
- 2022
- [e1]David Déharbe, Antti E. J. Hyvärinen:
Proceedings of the 20th Internal Workshop on Satisfiability Modulo Theories co-located with the 11th International Joint Conference on Automated Reasoning (IJCAR 2022) part of the 8th Federated Logic Conference (FLoC 2022), Haifa, Israel, August 11-12, 2022. CEUR Workshop Proceedings 3185, CEUR-WS.org 2022 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 01:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
