Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms

DOI10.1007/978-3-642-22438-6_20zbMath1341.68028OpenAlexW6183661MaRDI QIDQ5200029

Matt Fredrikson, Mihai Christodorescu, Somesh Jha

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22438-6_20

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Term Rewriting and All That
• Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms
• Finite state machines for strings over infinite alphabets
• Theory and Applications of Satisfiability Testing
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Dynamic Behavior Matching: A Complexity Analysis and New Approximation Algorithms