Model-Counting Approaches for Nonlinear Numerical Constraints

No abstract is available for this paper.

• Publication year

  2017

• Venue

  NASA Formal Methods

• Publication date

  2017-05-16

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-319-57288-8_9
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Multi-run Side-Channel Analysis Using Symbolic Execution and Max-SMT

  2016influential reference
• String analysis for side channels with segmented oracles

  2016cited by this paper
• Sound Probabilistic #SAT with Projection

  2016cited by this paper
• Model Counting Modulo Theories

  2015cited by this paper
• Approximate Probabilistic Inference via Word-Level Counting

  2015influential reference
• All-Solution Satisfiability Modulo Theories: Applications, Algorithms and Benchmarks

  2015cited by this paper
• Algebraic foundations for quantitative information flow

  2014cited by this paper
• Quantifying information leaks using reliability analysis

  2014cited by this paper
• Approximate counting in SMT and value estimation for probabilistic programs

  2014cited by this paper
• Compositional solution space quantification for probabilistic software analysis

  2014cited by this paper
• Editorial: ASE 2012 conference trip report

  2013cited by this paper
• Reliability analysis in Symbolic PathFinder

  2013cited by this paper
• SAT-Based Analysis and Quantification of Information Flow in Programs

  2013cited by this paper
• Symbolic PathFinder: integrating symbolic execution with model checking for Java bytecode analysis

  2013influential reference
• The MathSAT5 SMT Solver

  2013cited by this paper
• Dsharp: Fast d-DNNF Compilation with sharpSAT

  2012cited by this paper
• Stochastic Enumeration Method for Counting NP-Hard Problems

  2011cited by this paper
• Counting Zeros over Finite Fields Using Gröbner Bases

  2011cited by this paper
• Automatic Discovery and Quantification of Information Leaks

  2009cited by this paper
• PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials

  2009cited by this paper
• Z3: An Efficient SMT Solver

  2008cited by this paper
• Groebner bases computation in Boolean rings for symbolic model checking

  2007cited by this paper
• sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP

  2006cited by this paper
• A New Approach to Model Counting

  2005cited by this paper
• Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis

  2004cited by this paper
• Effective lattice point counting in rational convex polytopes

  2004influential reference
• Remote timing attacks are practical

  2003cited by this paper
• CUDD: CU Decision Diagram Package Release 2.2.0

  1998influential reference
• Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems

  1996cited by this paper
• On the Complexity of Derivation in Propositional Calculus

  1983cited by this paper
• Symbolic execution and program testing

  1976cited by this paper

• A scalable entropy estimator

  2025cites this paper
• Probabilistic program performance analysis with confidence intervals

  2022cites this paper
• Defining categorical reasoning of numerical feature models with feature-wise and variant-wise quality attributes

  2022cites this paper
• Quantifying Permissiveness of Access Control Policies

  2022cites this paper
• A Scalable Shannon Entropy Estimator

  2022cites this paper
• PREACH: A Heuristic for Probabilistic Reachability to Identify Hard to Reach Statements

  2022cites this paper
• Probabilistic profiling of stateful data planes for adversarial testing

  2021cites this paper
• PASAPTO: Policy-aware Security and Performance Trade-off Analysis--Computation on Encrypted Data with Restricted Leakage

  2020cites this paper
• Verified Software. Theories, Tools, and Experiments: 11th International Conference, VSTTE 2019, New York City, NY, USA, July 13–14, 2019, Revised Selected Papers

  2020cites this paper
• Symbolic Execution and Quantitative Reasoning: Applications to Software Safety and Security

  2020cites this paper
• MCBAT: a practical tool for model counting constraints on bounded integer arrays

  2020cites this paper
• AlloyMC: Alloy meets model counting

  2020cites this paper
• MCBAT: Model Counting for Constraints over Bounded Integer Arrays

  2020cites this paper
• Quantifying the Information Leakage in Cache Attacks via Symbolic Execution

  2019cites this paper
• Quantifying Information Leakage Using Model Counting Constraint Solvers

  2019cites this paper
• Subformula Caching for Model Counting and Quantitative Program Analysis

  2019cites this paper
• Chapter Five - Advances in Symbolic Execution

  2019cites this paper
• Parameterized model counting for string and numeric constraints

  2018cites this paper
• Symbolic Side-Channel Analysis for Probabilistic Programs

  2018cites this paper
• Quantifying the information leak in cache attacks via symbolic execution

  2017cites this paper
• Synthesis of Adaptive Side-Channel Attacks

  2017cites this paper
• Differential Performance Debugging with Discriminant Regression Trees

  2017cites this paper