Sciweavers

7124 search results - page 155 / 1425
» Programming Languages and Operating Systems
Sort
View
121
Voted
CORR
2010
Springer
127views Education» more  CORR 2010»
14 years 9 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
134
Voted
PPDP
2007
Springer
15 years 8 months ago
Higher-order semantic labelling for inductive datatype systems
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
Makoto Hamana
VSTTE
2005
Springer
15 years 8 months ago
It Is Time to Mechanize Programming Language Metatheory
How close are we to a world in which mechanically verified software is commonplace? A world in which theorem proving technology is used routinely by both software developers and p...
Benjamin C. Pierce, Peter Sewell, Stephanie Weiric...
102
Voted
CCS
2008
ACM
15 years 4 months ago
When good instructions go bad: generalizing return-oriented programming to RISC
This paper reconsiders the threat posed by Shacham's "return-oriented programming" -- a technique by which WX-style hardware protections are evaded via carefully cr...
Erik Buchanan, Ryan Roemer, Hovav Shacham, Stefan ...
240
Voted
ECOOP
2009
Springer
16 years 3 months ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio