default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID24th FMCAD 2024: Prague, Czech Republic
- Nina Narodytska, Philipp Rümmer:
Formal Methods in Computer-Aided Design, FMCAD 2024, Prague, Czech Republic, October 15-18, 2024. IEEE 2024, ISBN 978-3-85448-065-5 - Clark W. Barrett, Pei-Wei Chen, Byron Cook, Bruno Dutertre, Robert B. Jones, Nham Le, Andrew Reynolds, Kunal Sheth, Christopher Stephens, Michael W. Whalen:
SMT-D: New Strategies for Portfolio-Based SMT Solving. 1-10 - Josef Urban:
Some Adventures in Learning Proving, Instantiation and Synthesis. 1 - Mooly Sagiv:
Harnessing SMT Solvers for Reasoning about DeFi Protocols. 1 - Yi Zhou, Jay Bosamiya, Jessica Li, Marijn J. H. Heule, Bryan Parno:
Context Pruning for More Robust SMT-based Program Verification. 1-11 - Gianluca Redondi, Alessandro Cimatti, Alberto Griggio:
Towards Verification Modulo Theories of Asynchronous Systems via Abstraction Refinement. 1-5 - Jasmin Schult, Ben Fiedler, David A. Cock, Timothy Roscoe:
Semi-Open-State Testing for in-Silicon Coherent Interconnects. 1-10 - S. Hitarth, Cayden R. Codel, Hanna Lachnitt, Bruno Dutertre:
Extending DRAT to SMT. 1-11 - Aina Niemetz:
Tackling Scalability Issues in Bit-Vector Reasoning. 1 - K. Rustan M. Leino:
Writing Proofs in Dafny. 1 - Armin Biere, Katalin Fazekas
, Mathias Fleury, Nils Froleyks:
Clausal Equivalence Sweeping. 1-6 - Daniel Mendoza, Christopher Hahn, Caroline Trippel:
Translating Natural Language to Temporal Logics with Large Language Models and Model Checkers. 1-11 - Armin Biere, Nils Froleyks, Mathias Preiner:
Hardware Model Checking Competition 2024. 1 - Paul Bonnot, Benoît Boyer, Florian Faissole, Claude Marché, Raphaël Rieu-Helft:
Formally Verified Rounding Errors of the Logarithm-Sum-Exponential Function. 1-10 - Rachel Cleaveland, Caroline Trippel:
Memory Consistency Model-Aware Cache Coherence for Heterogeneous Hardware. 1-12 - Martin Blicha, Nestan Tsiskaridze:
The FMCAD 2024 Student Forum. 5-6 - Ross Daly, Caleb Donovick, Caleb Terrill, Jackson Melchert, Priyanka Raina, Clark W. Barrett, Pat Hanrahan:
Efficiently Synthesizing Lowest Cost Rewrite Rules for Instruction Selection. 8-17 - Kevin Lotz, Amit Goel, Bruno Dutertre, Benjamin Kiesl-Reiter, Soonho Kong, Dirk Nowotka:
Solving String Constraints with Concatenation Using SAT. 29-38 - Max Kopinsky, Brigitte Pientka, Xujie Si:
Modernizing SMT-Based Type Error Localization. 49-58 - Eytan Singher, Shachar Itzhaky:
Easter Egg: Equality Reasoning Based on E-Graphs with Multiple Assumptions. 70-83 - Antonina Nepeivoda:
Word Equations as Abstract Domain for String Manipulating Programs. 84-94 - Udayan Mandal, Guy Amir, Haoze Wu, Ieva Daukantas, Fletcher Lee Newell, Umberto J. Ravaioli, Baoluo Meng, Michael Durling, Milan Ganai, Tobey Shim, Guy Katz, Clark W. Barrett:
Formally Verifying Deep Reinforcement Learning Controllers with Lyapunov Barrier Certificates. 95-106 - Adharsh Kamath, Nausheen Mohammed, Aditya Senthilnathan, Saikat Chakraborty, Pantazis Deligiannis, Shuvendu K. Lahiri, Akash Lal, Aseem Rastogi, Subhajit Roy, Rahul Sharma:
Leveraging LLMs for Program Verification. 107-118 - Ian Dardik, April Porter, Eunsuk Kang:
Recomposition: A New Technique for Efficient Compositional Verification. 130-141 - Shuvendu K. Lahiri:
Evaluating LLM-driven User-Intent Formalization for Verification-Aware Languages. 142-147 - Karthik V. Nukala, Soumyaditya Choudhuri, Randal E. Bryant, Marijn J. H. Heule:
Translating Pseudo-Boolean Proofs into Boolean Clausal Proofs. 175-185 - Cayden R. Codel, Jeremy Avigad, Marijn J. H. Heule:
Verified Substitution Redundancy Checking. 186-196 - Long-Hin Fung, Che Cheng, Yu-Wei Fan, Tony Tan, Jie-Hong Roland Jiang:
2-DQBF Solving and Certification via Property-Directed Reachability Analysis. 197-207 - Loris D'Antoni, Andrew Gacek, Amit Goel, Dejan Jovanovic, Rami Gökhan Kici, Daniel Peebles, Neha Rungta, Yasmine Sharoda, Chungha Sung:
Projective Model Counting for IP Addresses in Access Control Policies. 208-216 - Rohit Dureja, Jason Baumgartner, Raj Kumar Gajavelly, Robert Kanzelman, Kristin Y. Rozier:
Toward Exhaustive Sequential Redundancy Removal. 217-226 - Suguman Bansal, Yash Kankariya, Yong Li:
DAG-Based Compositional Approaches for LTLf to DFA Conversions. 227-235 - Carl Kwan, Warren A. Hunt Jr.:
Automatic Verification of Right-Greedy Numerical Linear Algebra Algorithms. 242-250 - Alexander Konrad, Christoph Scholl:
Symbolic Computer Algebra for Multipliers Revisited - It's All About Orders and Phases. 261-271 - Martin Jonás, Jan Strejcek, Alberto Griggio:
Combining Symbolic Execution with Predicate Abstraction and CEGAR. 271-280 - Derek Egolf, William Schultz, Stavros Tripakis:
Efficient Synthesis of Symbolic Distributed Protocols by Sketching. 281-291 - Siddharth Priya, Arie Gurfinkel:
Ownership in Low-Level Intermediate Representation. 292-300
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 2025-05-06 21:18 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:
