899 search results - page 28 / 180 » A CTL-Based Logic for Program Abstractions |
113
Voted
FMICS
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. In this paper we propose a certification technique for noninterference of Java programs based on rewriting logic, a very general logical and semantic framework efficientl...
100
Voted
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
124
Voted
PLILP
1993
Springer
15 years 6 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
153
Voted
JELIA
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Among others, Alferes et al. (1998) presented an approach for updating logic programs with sets of rules based on dynamic logic programs. We syntactically redefine dynami...
140
Voted
AGP
2010
IEEE
15 years 7 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...