Cardinality Abstraction for Declarative Networking Applications

DOI10.1007/978-3-642-02658-4_43zbMath1242.68059OpenAlexW1951815472MaRDI QIDQ3636882

Atul Singh, Andrey Rybalchenko, Juan Antonio Navarro Pérez

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_43

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (1)

Sets with Cardinality Constraints in Satisfiability Modulo Theories

Uses Software

• BLAST
• PPL

This page was built for publication: Cardinality Abstraction for Declarative Networking Applications