default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMargus Veanes
- > Home > Persons > Margus Veanes
Publications
- 2021
[c74]Caleb Stanford
, Margus Veanes, Nikolaj S. Bjørner:
Symbolic Boolean derivatives for efficiently solving extended regular expression constraints. PLDI 2021: 620-635- 2017
- [j19]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. J. ACM 64(2): 14:1-14:28 (2017) - 2015
- [j17]Margus Veanes, Nikolaj S. Bjørner:
Symbolic tree automata. Inf. Process. Lett. 115(3): 418-424 (2015) - [c59]Margus Veanes, Nikolaj S. Bjørner:
Equivalence of Finite-Valued Symbolic Finite Transducers. Ershov Memorial Conference 2015: 276-290 - 2014
- [c55]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. CAV 2014: 628-645 - 2013
- [c48]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Effectively Monadic Predicates. LPAR (short papers) 2013: 97-103 - 2012
- [j15]Margus Veanes, Nikolaj S. Bjørner:
Alternating simulation and IOCO. Int. J. Softw. Tools Technol. Transf. 14(4): 387-405 (2012) - [c45]Nikolaj S. Bjørner, Vijay Ganesh, Raphaël Michel, Margus Veanes:
SMT-LIB Sequences and Regular Expressions. SMT@IJCAR 2012: 77-87 - [c44]Margus Veanes, Pieter Hooimeijer, Benjamin Livshits, David Molnar, Nikolaj S. Bjørner:
Symbolic finite state transducers: algorithms and applications. POPL 2012: 137-150 - [c43]Thomas Ball, Nikolaj S. Bjørner, Leonardo Mendonça de Moura, Kenneth L. McMillan, Margus Veanes:
Beyond First-Order Satisfaction: Fixed Points, Interpolants, Automata and Polynomials. SPIN 2012: 1-6 - [c42]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Automata: The Toolkit. TACAS 2012: 472-477 - 2011
- [j14]Margus Veanes, Nikolaj S. Bjørner:
Foundations of Finite Symbolic Tree Transducers. Bull. EATCS 105: 141-173 (2011) - [c41]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Tree Transducers. Ershov Memorial Conference 2011: 377-393 - 2010
- [c36]Margus Veanes, Nikolaj S. Bjørner, Leonardo Mendonça de Moura:
Symbolic Automata Constraint Solving. LPAR (Yogyakarta) 2010: 640-654 - [c35]Margus Veanes, Nikolaj S. Bjørner:
Alternating Simulation and IOCO. ICTSS 2010: 47-62 - 2009
- [j12]Margus Veanes, Nikolaj S. Bjørner, Yuri Gurevich, Wolfram Schulte:
Symbolic Bounded Model Checking of Abstract State Machines. Int. J. Softw. Informatics 3(2-3): 149-170 (2009) - [c34]Margus Veanes, Nikolaj S. Bjørner:
Symbolic Bounded Conformance Checking of Model Programs. Ershov Memorial Conference 2009: 388-400 - [c32]Margus Veanes, Nikolaj S. Bjørner:
Input-Output Model Programs. ICTAC 2009: 322-335 - 2008
- [c29]Margus Veanes, Nikolaj S. Bjørner, Alexander Raschke:
An SMT Approach to Bounded Reachability Analysis of Model Programs. FORTE 2008: 53-68
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-08-22 20:50 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:
