Skip to search formSkip to main contentSkip to account menu

Symposium on Logic in Computer Science

Known as: IEEE Symposium on Logic in Computer Science, Logic in Computer Science (IEEE symposium), LICS 
The ACM–IEEE Symposium on Logic in Computer Science (LICS) is an annual academic conference on the theory and practice of computer science in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

12 relations
ACM Transactions on Computational LogicComputer scienceDavide SangiorgiDexter Kozen

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Automatic Program Verification I : A Logical Basis and Its Implementation
“Task dependence and Termination in Ada”, Dillon ACM Trans. On Soft. Engg. and Methodology, Vol. 6, No.1, pp. 80-110, Jan. 1997… 
2015
2015
Certifications of programs with computational effects. (Certification de programmes avec des effets calculatoires)
In this thesis, we aim to formalize the effects of a computation. Indeed, most used programming languages involve different sorts… 
2012
2012
Sedimentation and tectonics of the Upper Proterozoic-Lower Cambrian deposits of the southern Małopolska Massif (SE Poland)
In the latest Precambrian and Early Cambrian, turbidity currents and cohesive flows transported pebbles, sand and mud into a deep… 
2012
2012
On the complexity of computing minimal unsatisfiable LTL formulas
We show that (1) the Minimal False QCNF search-problem (MF-search) and the Minimal Unsatisfiable LTL formula search problem (MU… 
2008
2008
Enforcing User-Defined Constraints during the Run-Time in OODB
In this paper a run-time model is proposed. The run-time model enforces integrity constraints for attributes that are derived… 
2008
2008
Resolution for a Temporal Logic of Robustness ( Extended Version )
The logic RoCTL* is an extension of the branching time temporal logic CTL* to represent robustness and reliability in systems… 
2001
2001
Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
This paper demonstrates the generation of a linear time query processing algorithm based on the constructive proof of Higman's… 
1997
1997
On the Foundations of Termination Analysis of Active Database Rules
Traditional database systems provide a mechanism for storing large amounts of data and an interface for querying and manipulating… 
1997
1997
A Partially Deadlock-free Typed Process Calculus (ii)
We propose a novel static type system for a process calculus, which ensures both partial deadlock-freedom and partial con… 
1993
1993
A model checker for statecharts (linking case tools with formal methods)
Computer-Aided Software Engineering (CASE) tools encourage users to codify the speciication for the design of a system early in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)