838 search results - page 30 / 168 » From Natural Language to Formal Proof Goal |
171
click to vote
ICFEM
2007
Springer
16 years 6 days ago
2007
Springer
We present a formal, tool-supported approach to the design and maintenance of access control policies expressed in the eXtensible Access Control Markup Language (XACML). Our aim is...
151
click to vote
ACL
2010
15 years 4 months ago
2010
We propose CMSMs, a novel type of generic compositional models for syntactic and semantic aspects of natural language, based on matrix multiplication. We argue for the structural ...
149
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
—In this paper we describe a practical methodology to formally verify highly optimized, industrial multipliers. We a multiplier description language which abstracts from low-leve...
157
click to vote
CSL
2005
Springer
15 years 11 months ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
189
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Proof-Carrying Code (PCC) is a general framework for verifying the safety properties of machine-language programs. PCC proofs are usually written in a logic extended with language...