default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonio Flores-Montoya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c12]Antonio Flores-Montoya, Eric M. Schulte:
Datalog Disassembly. USENIX Security Symposium 2020: 1075-1092
2010 – 2019
- 2019
- [i2]Antonio Flores-Montoya, Eric M. Schulte:
Datalog Disassembly. CoRR abs/1906.03969 (2019) - [i1]Eric M. Schulte, Jonathan Dorn, Antonio Flores-Montoya, Aaron Ballman, Tom Johnson:
GTIRB: Intermediate Representation for Binaries. CoRR abs/1907.02859 (2019) - 2017
- [b1]Antonio Flores-Montoya:
Cost Analysis of Programs Based on the Refinement of Cost Relations. Darmstadt University of Technology, Germany, 2017 - [j2]Elvira Albert, Antonio Flores-Montoya, Samir Genaim
, Enrique Martin-Martin:
Rely-Guarantee Termination and Cost Analyses of Loops with Concurrent Interleavings. J. Autom. Reason. 59(1): 47-85 (2017) - 2016
- [j1]Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
May-Happen-in-Parallel Analysis for Actor-Based Concurrency. ACM Trans. Comput. Log. 17(2): 11 (2016) - [c11]Antonio Flores-Montoya:
Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations. FM 2016: 254-273 - 2015
- [c10]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
May-Happen-in-Parallel Analysis with Condition Synchronization. FOPARA 2015: 1-19 - 2014
- [c9]Antonio Flores-Montoya, Reiner Hähnle:
Resource Analysis of Complex Programs with Cost Equations. APLAS 2014: 275-295 - [c8]Richard Bubel, Antonio Flores-Montoya, Reiner Hähnle:
Analysis of Executable Software Models. SFM 2014: 1-25 - [c7]Elvira Albert, Puri Arenas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Enrique Martin-Martin, German Puebla, Guillermo Román-Díez:
SACO: Static Analyzer for Concurrent Objects. TACAS 2014: 562-567 - 2013
- [c6]Elvira Albert, Antonio Flores-Montoya, Samir Genaim, Enrique Martin-Martin:
Termination and Cost Analysis of Loops with Concurrent Interleavings. ATVA 2013: 349-364 - [c5]Antonio Flores-Montoya, Elvira Albert, Samir Genaim:
May-Happen-in-Parallel Based Deadlock Analysis for Concurrent Objects. FMOODS/FORTE 2013: 273-288 - 2012
- [c4]Elvira Albert, Diego Esteban Alonso-Blas, Puri Arenas, Jesús Correas, Antonio Flores-Montoya, Samir Genaim, Miguel Gómez-Zamalloa, Abu Naser Masud, German Puebla, José Miguel Rojas, Guillermo Román-Díez, Damiano Zanardini:
Automatic Inference of Bounds on Resource Consumption. FMCO 2012: 119-144 - [c3]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
Analysis of May-Happen-in-Parallel in Concurrent Objects. FMOODS/FORTE 2012: 35-51 - [c2]Elvira Albert, Antonio Flores-Montoya, Samir Genaim:
MayPar: a may-happen-in-parallel analyzer for concurrent objects. SIGSOFT FSE 2012: 14 - 2011
- [c1]Elvira Albert, Israel Cabanas, Antonio Flores-Montoya, Miguel Gómez-Zamalloa, Sergio Gutierrez:
jPET: An Automatic Test-Case Generator for Java. WCRE 2011: 441-442
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-05-08 21:03 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:
