Sciweavers

492 search results - page 61 / 99
» Simplifying Probabilistic Programs Using Computer Algebra
Sort
View
FROCOS
2007
Springer
15 years 8 months ago
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Beatriz Alarcón, Salvador Lucas
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
15 years 2 months ago
Conservative swept volume boundary approximation
We present a novel technique for approximating the boundary of a swept volume. The generator given by an input triangle mesh is rendered under all rigid transformations of a discr...
Andreas von Dziegielewski, R. Erbes, Elmar Sch&oum...
CHI
2007
ACM
15 years 6 months ago
Aligning development tools with the way programmers think about code changes
Software developers must modify their programs to keep up with changing requirements and designs. Often, a conceptually simple change can require numerous edits that are similar b...
Marat Boshernitsan, Susan L. Graham, Marti A. Hear...
116
Voted
IH
2007
Springer
15 years 8 months ago
Software Integrity Checking Expressions (ICEs) for Robust Tamper Detection
Abstract. We introduce software integrity checking expressions (SoftICEs), which are program predicates that can be used in software tamper detection. We present two candidates, pr...
Mariusz H. Jakubowski, Prasad Naldurg, Vijay Patan...
LICS
2006
IEEE
15 years 8 months ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon