Sciweavers

8132 search results - page 134 / 1627
» Dependability, Abstraction, and Programming
Sort
View
PADL
2004
Springer
15 years 11 months ago
Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
Chiyan Chen, Dengping Zhu, Hongwei Xi
WCRE
2007
IEEE
16 years 22 days ago
Recovering Data Models via Guarded Dependences
This paper presents an algorithm for reverse engineering semantically sound object-oriented data models from programs written in weakly-typed languages like Cobol. Our inference i...
Raghavan Komondoor, G. Ramalingam
ISSTA
2010
ACM
15 years 10 months ago
Strict control dependence and its effect on dynamic information flow analyses
Program control dependence has substantial impact on applications such as dynamic information flow tracking and data lineage tracing (a technique tracking the set of inputs that ...
Tao Bao, Yunhui Zheng, Zhiqiang Lin, Xiangyu Zhang...
CSFW
2007
IEEE
16 years 24 days ago
Dynamic Dependency Monitoring to Secure Information Flow
Although static systems for information flow security are well-studied, few works address run-time information flow monitoring. Run-time information flow control offers distinc...
Paritosh Shroff, Scott F. Smith, Mark Thober
AOSD
2009
ACM
16 years 1 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu