A fixpoint calculus for local and global program flows

DOI10.1145/1111037.1111051zbMath1370.68051MaRDI QIDQ5348921

P. Madhusudan, Swarat Chaudhuri, Rajeev Alur

Publication date: 21 August 2017

Published in: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/cgi/viewcontent.cgi?article=1533&context=cis_papers

zbMATH Keywords

verification; \(\mu\)-calculus; model checking; specification; games; program logic; pushdown systems; infinite-state

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03B45: Modal logic (including the logic of norms)

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

68Q60: Specification and verification (program logics, model checking, etc.)

68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)

Related Items

A Branching Time Variant of CaRet, Temporal logics with language parameters, Interval Temporal Logic for Visibly Pushdown Systems, Reducing behavioural to structural properties of programs with procedures, A structural/temporal query language for business processes, A saturation method for the modal \(\mu \)-calculus over pushdown systems, Regular languages of nested words: fixed points, automata, and synchronization, Summarization for termination: No return!, Colored nested words, Propositional dynamic logic with recursive programs, Model Checking Procedural Programs, Nested Sibling Tree Automata