Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20. SAS 2013: Seattle, WA, USA
- Francesco Logozzo, Manuel Fähndrich:
Static Analysis - 20th International Symposium, SAS 2013, Seattle, WA, USA, June 20-22, 2013. Proceedings. Lecture Notes in Computer Science 7935, Springer 2013, ISBN 978-3-642-38855-2 - Eric Goubault:
Static Analysis by Abstract Interpretation of Numerical Programs and Systems, and FLUCTUAT. 1-3 - Sriram Sankaranarayanan:
Static Analysis in the Continuously Changing World. 4-5 - Graeme Gange
, Jorge A. Navas, Peter Schachte, Harald Søndergaard, Peter J. Stuckey:
Abstract Interpretation over Non-lattice Abstract Domains. 6-24 - Gianluca Amato, Francesca Scozzari:
Localizing Widening and Narrowing. 25-42 - Caterina Urban:
The Abstract Domain of Segmented Ranking Functions. 43-62 - Hila Peleg, Sharon Shoham, Eran Yahav, Hongseok Yang:
Symbolic Automata for Static Specification Mining. 63-83 - Andrei Marian Dan, Yuri Meshman, Martin T. Vechev, Eran Yahav:
Predicate Abstraction for Relaxed Memory Models. 84-104 - Nikolaj S. Bjørner, Kenneth L. McMillan, Andrey Rybalchenko:
On Solving Universally Quantified Horn Clauses. 105-125 - Subhajit Roy:
From Concrete Examples to Heap Manipulating Programs. 126-149 - Cezara Dragoi, Constantin Enea, Mihaela Sighireanu:
Local Shape Analysis for Overlaid Data Structures. 150-171 - Pranav Garg, P. Madhusudan, Gennaro Parlato:
Quantified Data Automata on Skinny Trees: An Abstract Domain for Lists. 172-193 - Hyunha Kim, Kyung-Goo Doh, David A. Schmidt:
Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing. 194-214 - Kamil Dudka, Petr Peringer, Tomás Vojnar:
Byte-Precise Verification of Low-Level List Manipulation. 215-237 - Nimrod Partush, Eran Yahav:
Abstract Semantic Differencing for Numerical Programs. 238-258 - Raghavan Komondoor:
Precise Slicing in Imperative Programs via Term-Rewriting and Abstract Interpretation. 259-282 - Veselin Raychev, Martin T. Vechev, Eran Yahav:
Automatic Synthesis of Deterministic Concurrency. 283-303 - Kedar S. Namjoshi, Lenore D. Zuck:
Witnessing Program Transformations. 304-323 - Sandrine Blazy, Vincent Laporte, André Maroneze, David Pichardie:
Formal Verification of a C Value Analysis Based on Abstract Interpretation. 324-344 - Alexis Fouilhé, David Monniaux, Michaël Périn:
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. 345-365 - Rupak Majumdar, Roland Meyer, Zilong Wang:
Static Provenance Verification for Message Passing Programs. 366-387 - Rahul Sharma, Saurabh Gupta, Bharath Hariharan, Alex Aiken, Aditya V. Nori:
Verification as Learning Geometric Concepts. 388-411 - Martin Brain, Vijay Victor D'Silva, Alberto Griggio, Leopold Haller, Daniel Kroening:
Interpolation-Based Verification of Floating-Point Programs with Abstract CDCL. 412-432 - Leo White, Alan Mycroft:
Concise Analysis Using Implication Algebras for Task-Local Memory Optimisation. 433-453 - Emanuele D'Osualdo, Jonathan Kochems, C.-H. Luke Ong:
Automatic Verification of Erlang-Style Concurrency. 454-476 - Peter Lammich, Markus Müller-Olm, Helmut Seidl, Alexander Wenner:
Contextual Locking for Dynamic Pushdown Networks. 477-498
a service of 
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.
last updated on 2024-09-07 00:48 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:
