Sciweavers

9626 search results - page 460 / 1926
» Invariant Based Programming
Sort
View
AGP
2010
IEEE
15 years 12 months ago
Proof-Theoretic and Higher-Order Extensions of Logic Programming
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...
Alberto Momigliano, Mario Ornaghi
ASPDAC
1999
ACM
77views Hardware» more  ASPDAC 1999»
15 years 11 months ago
Timing-Driven Bipartitioning with Replication Using Iterative Quadratic Programming
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
Shihliang Ou, Massoud Pedram
TACS
1994
Springer
15 years 11 months ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
CSFW
2007
IEEE
15 years 10 months ago
Automaton-based Confidentiality Monitoring of Concurrent Programs
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
Gurvan Le Guernic
CSFW
2007
IEEE
15 years 10 months ago
Secure information flow and program logics
We present interpretations of type systems for secure information flow in Hoare logic, complementing previous encodings in binary (e.g. relational) program logics. Treating base-l...
Lennart Beringer, Martin Hofmann