Sciweavers

890 search results - page 140 / 178
» Programming language methods in computer security
Sort
View
160
Voted
JMLR
2012
13 years 3 months ago
Learning Low-order Models for Enforcing High-order Statistics
Models such as pairwise conditional random fields (CRFs) are extremely popular in computer vision and various other machine learning disciplines. However, they have limited expre...
Patrick Pletscher, Pushmeet Kohli
139
Voted
ACL2
2006
ACM
15 years 6 months ago
Soundness of the simply typed lambda calculus in ACL2
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
Sol Swords, William R. Cook
ICTAC
2004
Springer
15 years 6 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
104
Voted
OOPSLA
2007
Springer
15 years 6 months ago
Modular typestate checking of aliased objects
Objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and i...
Kevin Bierhoff, Jonathan Aldrich
99
Voted
ENTCS
2007
108views more  ENTCS 2007»
15 years 15 days ago
Generating Java Compiler Optimizers Using Bidirectional CTL
There have been several research works that analyze and optimize programs using temporal logic. However, no evaluation of optimization time or execution time of these implementati...
Ling Fang, Masataka Sassa