Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68031OpenAlexW2494235144MaRDI QIDQ5325866FDOQ5325866

Luca Compagna, Alessandro Armando

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

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

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)

Cited In (7)

• Logics in Artificial Intelligence
• GridSAT: Design and implementation of a computational grid application
• 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
• Title not available (Why is that?)
• Logic Programming

Uses Software

• TAPS
• SATO
• Casper
• Chaff
• BerkMin

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)