1199 search results - page 126 / 240 » Parameterized Proof Complexity |
TASE
2009
IEEE
14 years 6 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
CIE
2007
Springer
14 years 5 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
LPAR
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
LICS
2006
IEEE
14 years 5 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...
ICMCS
2005
IEEE
14 years 4 months ago
2005
IEEE
In line with the recent call for technology on Image Based Authentication (IBA) in JPEG committee [1], we present a novel graphical password design in this paper. It rests on the ...