An effective bottom-up semantics for first-order linear logic programs

DOI10.1007/3-540-44716-4_9MaRDI QIDQ2763695zbMATH OpenFDO

Authors Marco Bozzano, Giorgio Delzanno, M. Martelli

Publication date 22 January 2002

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

Full work available at URL https://doi.org/10.1007/3-540-44716-4_9

zbMATH Keywords

symbolic model checking

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Logic programming (68N17) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computing methodologies and applications (68U99)

Recommendations

• An effective fixpoint semantics for linear logic programs
• Model checking linear logic specifications
• Linear Logical Algorithms
• On the relations between disjunctive and linear logic programming
• scientific article; zbMATH DE number 1361538

Cited in

(7)

• Linear Logical Algorithms
• An effective fixpoint semantics for linear logic programs
• Model checking linear logic specifications
• An assertional language for the verification of systems parametric in several dimensions (preliminary results)
• On the relations between disjunctive and linear logic programming
• scientific article; zbMATH DE number 5244180 (Why is no real title available?)
• Well-structured transition systems everywhere!

This page was built for publication: An effective bottom-up semantics for first-order linear logic programs

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