Article

A Perfect Model for Bounded Verification

Authors:

Javier Esparza,

Rupak MajumdarAuthors Info & Claims

LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

Pages 285 - 294

https://doi.org/10.1109/LICS.2012.39

Published: 25 June 2012 Publication History

Abstract

A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the language generated by the system is disjoint from the language of bad traces. Regular languages are perfect, but because the disjointness problem for CFLs is undecidable, no class containing the CFLs can be perfect. In practice, verification problems for language classes that are not perfect are often under-approximated by checking if the property holds for all behaviors of the system belonging to a fixed subset. A general way to specify a subset of behaviors is by using bounded languages (languages of the form w1* ... wk* for fixed words w1,...,wk). A class of languages C is perfect modulo bounded languages if it is closed under Boolean operations relative to every bounded language, and if the emptiness problem is decidable relative to every bounded language. We consider finding perfect classes of languages modulo bounded languages. We show that the class of languages accepted by multi-head pushdown automata are perfect modulo bounded languages, and characterize the complexities of decision problems. We also show that bounded languages form a maximal class for which perfection is obtained. We show that computations of several known models of systems, such as recursive multi-threaded programs, recursive counter machines, and communicating finite-state machines can be encoded as multi-head pushdown automata, giving uniform and optimal under approximation algorithms modulo bounded languages.

References

[1]

R. Alur and P. Madhusudan, "Adding nesting structure to words," J. ACM, vol. 56, no. 3, 2009.

Digital Library

[2]

M. F. Atig, A. Bouajjani, and S. Qadeer, "Context-bounded analysis for concurrent programs with dynamic creation of threads," Logical Methods in Computer Science, vol. 7, no. 4, 2011.

[3]

S. Bardin and A. Finkel, "Composition of accelerations to verify infinite heterogeneous systems," in ATVA'04: Automated Technology for Verification and Analysis, ser. LNCS, vol. 3299. Springer, 2004, pp. 248-262.

[4]

S. Bardin, A. Finkel, J. Leroux, and L. Petrucci, "FAST: acceleration from theory to practice," STTT, vol. 10, no. 5, pp. 401-424, 2008.

Digital Library

[5]

A. Bouajjani and P. Habermehl, "Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations," Theor. Comput. Sci., vol. 221, no. 1-2, pp. 211-250, 1999.

Digital Library

[6]

D. Brand and P. Zafiropulo, "On communicating finite-state machines," J. ACM, vol. 30, no. 2, pp. 323-342, 1983.

Digital Library

[7]

M. Cadilhac, A. Finkel, and P. McKenzie, "Bounded Parikh automata," in WORDS'11: Proc. 8th Int. Conf. WORDS, ser. Electronic Proceedings in Theoretical Computer Science, vol. 63, 2011, pp. 93-102.

[8]

E. M. Clarke, A. Biere, R. Raimi, and Y. Zhu, "Bounded model checking using satisfiability solving," Formal Methods in System Design, vol. 19, no. 1, pp. 7-34, 2001.

Digital Library

[9]

E. M. Clarke, D. Kroening, and K. Yorav, "Behavioral consistency of C and Verilog programs using bounded model checking," in DAC'03: Design Automation Conference. ACM, 2003, pp. 368-371.

Digital Library

[10]

J. Esparza and P. Ganty, "Complexity of pattern-based verification for multithreaded programs," in POPL'11: Principles of Programming Languages. ACM, 2011, pp. 499-510.

Digital Library

[11]

J. Esparza, P. Ganty, and R. Majumdar, "A perfect model for bounded verification," CoRR, vol. abs/1201.3194, 2012.

[12]

M. Fürer, "The complexity of Presburger arithmetic with bounded quantifier alternation depth," Theor. Comput. Sci., vol. 18, pp. 105-111, 1982.

[13]

S. Ginsburg, The Mathematical Theory of Context-Free Languages. New York, NY, USA: McGraw-Hill, Inc., 1966.

Digital Library

[14]

M. Hague and A. W. Lin, "Model checking recursive programs with numeric data types," in CAV'11: Computer Aided Verification, ser. LNCS. Springer, 2011.

Digital Library

[15]

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1st ed. Addison-Wesley, April 1979.

Digital Library

[16]

O. H. Ibarra, "Generalizations of pushdown automata," Ph.D. dissertation, University of California, Berkeley, 1967.

[17]

O. H. Ibarra, "A note on semilinear sets and bounded-reversal multihead push-down automata," Inf. Proc. Letters, vol. 3, no. 1, pp. 25-28, 1974.

[18]

O. H. Ibarra, "Reversal-bounded multicounter machines and their decision problems," Journal of the ACM, vol. 25, no. 1, pp. 116-133, 1978.

Digital Library

[19]

V. Kahlon, "Tractable dataflow analysis for concurrent programs via bounded languages," July 2009, patent WO/2009/094439.

[20]

J. Leroux and G. Sutre, "Flat counter automata almost everywhere," in ATVA'05: Automated Technology for Verification and Analysis, ser. LNCS, vol. 3707. Springer, 2005, pp. 489-503.

Digital Library

[21]

M. Minsky, Finite and Infinite Machines. Englewood Cliffs, N.J., Prentice-Hall, 1967.

Digital Library

[22]

A. Okhotin, "Conjunctive grammars," J. Automata, Languages and Combinatorics, vol. 6:4, pp. 519-535, 2001.

Digital Library

[23]

S. Qadeer, "The case for context-bounded verification of concurrent programs," in SPIN'08: Model Checking Software, ser. LNCS, vol. 5156. Springer, 2008, pp. 3-6.

Digital Library

[24]

S. Qadeer and J. Rehof, "Context-bounded model checking of concurrent software," in TACAS'05: Tools and Algorithms for the Construction and Analysis of Systems, ser. LNCS, vol. 3440. Springer, 2005, pp. 93-107.

Digital Library

[25]

C. R. Reddy and D. W. Loveland, "Presburger arithmetic with bounded quantifier alternation," in STOC'78: Proc. of the 10th Annual ACM Symposium on Theory of Computing. ACM, 1978, pp. 320-325.

Digital Library

[26]

A. L. Rosenberg, "On multi-head finite automata," IBM J. Res. Dev., vol. 10, no. 5, pp. 388-394, 1966.

Digital Library

[27]

I. H. Sudborough, "Bounded-reversal multihead finite automaton languages," Information and Control, vol. 25, pp. 317-328, 1974.

[28]

S. L. Torre, P. Madhusudan, and G. Parlato, "A robust class of context-sensitive languages," in LICS'07: Logic in Computer Science. IEEE Computer Society, 2007, pp. 161-170.

Digital Library

[29]

K. N. Verma, H. Seidl, and T. Schwentick, "On the complexity of equational Horn clauses," in CADE'05: 20th Int. Conf. on Automated Deduction, ser. LNCS, vol. 1831. Springer, 2005, pp. 337-352.

Digital Library

[30]

J. von zur Gathen and M. Sieveking, "A bound on solutions of linear integer equalities and inequalities," Proceedings of the American Mathematical Society, vol. 72, no. 1, pp. 155-158, 1978.

Cited By

Dimitrova RMajumdar R(2018)Reachability analysis of reversal-bounded automata on series---parallel graphsActa Informatica10.1007/s00236-016-0290-155:2(153-189)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1007/s00236-016-0290-1
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer P(2017)Flatten and conquer: a framework for efficient analysis of string constraintsACM SIGPLAN Notices10.1145/3140587.306238452:6(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062384
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer PCohen AVechev M(2017)Flatten and conquer: a framework for efficient analysis of string constraintsProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062384(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062384
Show More Cited By

A Perfect Model for Bounded Verification
1. Software and its engineering
  1. Software notations and tools
2. Theory of computation

Recommendations

Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications V

Limited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
P-hardness of the emptiness problem for visibly pushdown languages

Visibly pushdown languages form a subclass of the context-free languages which is appealing because of its nice algorithmic and closure properties. Here we show that the emptiness problem for this class is not any easier than the emptiness problem for ...
A power-set construction for reducing Büchi automata to non-determinism degree two

Buchi automata are finite automata that accept languages of infinitely long strings, so-called @w-languages. It is well known that, unlike in the finite-string case, deterministic and non-deterministic Buchi automata accept different @w-language classes,...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

LICS '12: Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science

June 2012

624 pages

ISBN:9780769547695

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

IEEE Computer Society

United States

Publication History

Published: 25 June 2012

Check for updates

Author Tags

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 215 of 622 submissions, 35%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
141
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dimitrova RMajumdar R(2018)Reachability analysis of reversal-bounded automata on series---parallel graphsActa Informatica10.1007/s00236-016-0290-155:2(153-189)Online publication date: 1-Mar-2018
https://dl.acm.org/doi/10.1007/s00236-016-0290-1
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer P(2017)Flatten and conquer: a framework for efficient analysis of string constraintsACM SIGPLAN Notices10.1145/3140587.306238452:6(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062384
Abdulla PAtig MChen YDiep BHolík LRezine ARümmer PCohen AVechev M(2017)Flatten and conquer: a framework for efficient analysis of string constraintsProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062384(602-617)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062384
Bhave DDave VKrishna SPhawade RTrivedi A(2016)A Perfect Class of Context-Sensitive Timed LanguagesProceedings of the 20th International Conference on Developments in Language Theory - Volume 984010.1007/978-3-662-53132-7_4(38-50)Online publication date: 25-Jul-2016
https://dl.acm.org/doi/10.1007/978-3-662-53132-7_4
Atig MNarayan Kumar KSaivasan P(2016)Acceleration in Multi-PushDown SystemsProceedings of the 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 963610.1007/978-3-662-49674-9_45(698-714)Online publication date: 2-Apr-2016
https://dl.acm.org/doi/10.1007/978-3-662-49674-9_45
Leroux JPenelle VSutre G(2013)On the Context-Freeness Problem for Vector Addition SystemsProceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS.2013.9(43-52)Online publication date: 25-Jun-2013
https://dl.acm.org/doi/10.1109/LICS.2013.9

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents