Specification Sketching for Linear Temporal Logic

Lutz, Simon; Neider, Daniel; Roy, Rajarshi

doi:10.1007/978-3-031-45332-8_2

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Book3

Other1

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Specification Sketching for Linear Temporal Logic

Lutz,

Neider,

Roy

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Specification Sketching for Linear Temporal Logic

Lutz,

Neider,

Roy

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic

Raha,

Roy,

Fijalkow

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

SAT-Based Learning of Computation Tree Logic

Pommellet,

Stan,

Scatton

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The learning problem consists in finding for a given sample of positive and negative Kripke structures a distinguishing formula that is verified by the former but not by the latter. Further constraints may bound the size and shape of the desired formula or even ask for its minimality in terms of syntactic size. This synthesis problem is motivated by explanation generation for dissimilar models, e.g. comparing a faulty implementation with the original protocol. We devise a -based encoding for a fixed size formula, then provide an incremental approach that guarantees minimality. We further report on a prototype implementation whose contribution is twofold: first, it allows us to assess the efficiency of various output fragments and optimizations. Secondly, we can experimentally evaluate this tool by randomly mutating Kripke structures or syntactically introducing errors in higher-level models, then learning distinguishing formulas.

show abstract

Specification Sketching for Linear Temporal Logic

Cited by 4 publications

References 46 publications

Specification Sketching for Linear Temporal Logic

Specification Sketching for Linear Temporal Logic

Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic

SAT-Based Learning of Computation Tree Logic

Contact Info

Product

Resources

About