Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325866zbMATH OpenOpenAlexFDO

Authors Alessandro Armando, Luca Compagna

Publication date 24 July 2009

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

Full work available at URL https://doi.org/10.1007/b95238

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1973985
• An optimized intruder model for SAT-based model-checking of security protocols
• SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
• A satisfiability-based approach to abstraction refinement in model checking
• Information based reasoning about security protocols

Cited in

(10)

• Safe abstractions of data encodings in formal security protocol models
• Logics in Artificial Intelligence
• GridSAT: Design and implementation of a computational grid application
• Information based reasoning about security protocols
• Ordering from Satan's menu: a survey of requirements specification for formal analysis of cryptographic protocols
• SAT-Based Verification of Security Protocols Via Translation to Networks of Automata
• Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols
• scientific article; zbMATH DE number 1973985 (Why is no real title available?)
• An optimized intruder model for SAT-based model-checking of security protocols
• Logic Programming

Describes a project that uses

Uses Software

• BerkMin
• Chaff
• Casper
• SATO
• TAPS

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325866)