Filters








515 Hits in 2.9 sec

Weighted Pushdown Systems with Indexed Weight Domains

Yasuhiko Minamide, Scott Smolka
2016 Logical Methods in Computer Science  
Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule.  ...  We then generalize weighted pushdown systems by introducing semirings indexed by the monoid and weaken the boundedness to local boundedness.  ...  We present several applications of pushdown systems with indexed weighted domains.  ... 
doi:10.2168/lmcs-12(2:9)2016 fatcat:qo34o2jhvrdfxdphnqryux6wxm

Weighted Pushdown Systems with Indexed Weight Domains [chapter]

Yasuhiko Minamide
2013 Lecture Notes in Computer Science  
Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule.  ...  We then generalize weighted pushdown systems by introducing semirings indexed by the monoid and weaken the boundedness to local boundedness.  ...  We present several applications of pushdown systems with indexed weighted domains.  ... 
doi:10.1007/978-3-642-36742-7_17 fatcat:bqp5fnhoqfhhbp2p62xp6j4q5q

Cumulative subject index volumes 64–67

1985 Information and Control  
logic, 65, 98 Dictionaries containing weighted elements: implicit data structures, 66, 61 Domains Scott, and synchronization trees and metric spaces, relationships, 66, 6 Dynamic logic first-order  ...  separation theorem, 66, 177 Translation simple loop programs with primitive con- ditional statements, 65, 42 Trees AVL-, for localized search, 67, 173 synchronization, and Scott domains and metric  ... 
doi:10.1016/s0019-9958(85)80038-3 fatcat:cnfpoerj4bgahkwbjf5nrkty5e

Conditional weighted pushdown systems and applications

Xin Li, Mizuhito Ogawa
2010 Proceedings of the ACM SIGPLAN 2010 workshop on Partial evaluation and program manipulation - PEPM '10  
There are wider applications of conditional weighted pushdown systems when analyzing programs with objected-oriented features, for which weighted pushdown systems is not precise enough under a direct application  ...  Pushdown systems are well understood as abstract models of programs with (recursive) procedures.  ...  String Conditional Weighted Pushdown Model Checking Conditional Weighted Pushdown Systems We extend pushdown systems to conditional pushdown systems, by further associating each transition rule with  ... 
doi:10.1145/1706356.1706382 dblp:conf/pepm/LiO10 fatcat:nekp6nimcbaz3ftdzfcde2cgna

Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution [chapter]

Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito Ogawa, Sreeranga P. Rajan, Sarfraz Khurshid
2008 Lecture Notes in Computer Science  
In this paper, we present a context-sensitive relevancy analysis algorithm based on weighted pushdown model checking, which pinpoints memory locations in the program where symbolic values can flow into  ...  Our technique is evaluated on a generalized symbolic execution engine that is developed upon Java Path Finder with checking safety properties of Java applications.  ...  A weighted pushdown system extends a pushdown system by associating a weight to each transition rule. The weights come from a bounded idempotent semiring. 1.  ... 
doi:10.1007/978-3-540-89330-1_4 fatcat:ke7gd4nrm5f4rnnxyohacxqbr4

Path Optimization in Programs and Its Application to Debugging [chapter]

Akash Lal, Junghee Lim, Marina Polishchuk, Ben Liblit
2006 Lecture Notes in Computer Science  
We derive an efficient algorithm for path optimization based on weighted pushdown systems.  ...  We present an application for path optimization by integrating it with the Cooperative Bug Isolation Project (CBI), a dynamic debugging system.  ...  Weighted Pushdown Systems A weighted pushdown system (WPDS) is obtained by associating a weight with each pushdown rule.  ... 
doi:10.1007/11693024_17 fatcat:srzjbiwjsbbm7d32fkhuxwrmoe

Faster Algorithms for Weighted Recursive State Machines [chapter]

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis
2017 Lecture Notes in Computer Science  
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis.  ...  We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow  ...  The existing results for weighted pushdown systems over semirings of height H [36, 34] along with the linear translation of RSMs to pushdown systems [4] gives an O(H • |R| • θ e • θ x • f )-time algorithm  ... 
doi:10.1007/978-3-662-54434-1_11 fatcat:m5do7fcslbbrbptcxcwrob452y

Program Analysis Using Weighted Pushdown Systems [chapter]

Thomas Reps, Akash Lal, Nick Kidd
2007 Lecture Notes in Computer Science  
Weighted pushdown systems (WPDSs) are a generalization of PDSs that add a general "black-box" abstraction for program data (through weights).  ...  Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems.  ...  Weighted Pushdown Systems A weighted pushdown system is obtained by augmenting a PDS with a weight domain that is a bounded idempotent semiring [42, 7] .  ... 
doi:10.1007/978-3-540-77050-3_4 fatcat:ow4rlt653veepplb3shukiloj4

Faster Algorithms for Weighted Recursive State Machines [article]

Krishnendu Chatterjee, Bernhard Kragl, Samarth Mishra, Andreas Pavlogiannis
2017 arXiv   pre-print
Pushdown systems (PDSs) and recursive state machines (RSMs), which are linearly equivalent, are standard models for interprocedural analysis.  ...  We consider a general framework where RSM transitions are labeled from a semiring and path properties are algebraic with semiring operations, which can model, e.g., interprocedural reachability and dataflow  ...  The existing results for weighted pushdown systems over semirings of height H [36, 34] along with the linear translation of RSMs to pushdown systems [4] gives an O(H · |R| · θ e · θ x · f )-time algorithm  ... 
arXiv:1701.04914v1 fatcat:xtmgz2yiwvav5j4d52eaccsotq

Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis [chapter]

Thomas Reps, Stefan Schwoon, Somesh Jha
2003 Lecture Notes in Computer Science  
Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-all-paths value (for paths that meet  ...  The algorithms described in the paper have been implemented: We have created an extended version of MOPED [22] (a model checker for pushdown systems) that solves reachability problems for weighted PDSs  ...  Weighted Pushdown Systems A weighted pushdown system is a pushdown system whose rules are given values from some domain of weights.  ... 
doi:10.1007/3-540-44898-5_11 fatcat:tbbjhcimsjcv3kqb4bsvo66imi

Weighted pushdown systems and their application to interprocedural dataflow analysis

Thomas Reps, Stefan Schwoon, Somesh Jha, David Melski
2005 Science of Computer Programming  
Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-all-paths value (for paths that meet  ...  The algorithms described in the paper have been implemented: We have created an extended version of MOPED [22] (a model checker for pushdown systems) that solves reachability problems for weighted PDSs  ...  Weighted Pushdown Systems A weighted pushdown system is a pushdown system whose rules are given values from some domain of weights.  ... 
doi:10.1016/j.scico.2005.02.009 fatcat:5r7gez6ibbfuhadnbjtigsavy4

An intermediate representation for optimizing machine learning pipelines

Andreas Kunft, Asterios Katsifodimos, Sebastian Schelter, Sebastian Breß, Tilmann Rabl, Volker Markl
2019 Proceedings of the VLDB Endowment  
Monads enable operator pushdown and fusion across type and loop boundaries.  ...  Current systems are tailored to either of the two. As a consequence, preprocessing and ML steps are optimized in isolation.  ...  Domain-specific optimizations such as reordering linear algebra and operator pushdown are not supported.  ... 
doi:10.14778/3342263.3342633 fatcat:sj3u4vklbfdsdpiuj64vdbd6ki

Stacking-Based Context-Sensitive Points-to Analysis for Java [chapter]

Xin Li, Mizuhito Ogawa
2011 Lecture Notes in Computer Science  
This paper presents a stacking-based context-sensitive points-to analysis for Java, by deriving the analysis as weighted pushdown model checking problems.  ...  and loads global references with synchronized points-to information on-demand.  ...  Stefan for help us using the Weighted PDS Library. We also thank anonymous reviewers for their valuable comments.  ... 
doi:10.1007/978-3-642-19237-1_14 fatcat:5r5gnzfphvh77d2hmno2hyem34

Provably Stable Interpretable Encodings of Context Free Grammars in RNNs with a Differentiable Stack [article]

John Stogin, Ankur Mali, C Lee Giles
2020 arXiv   pre-print
We build a RNN specifically structured like a PDA, where weights correspond directly to the PDA rules.  ...  Since CFGs are the languages recognized by pushdown automata (PDA), it suffices to determine the state transition rules and stack action rules of the corresponding PDA.  ...  Finally, for tensors W with indices j, k, and l, the l index is paired with the stack reading vector.  ... 
arXiv:2006.03651v3 fatcat:urz63uny4nf5vmxoxeyiztrvai

Approximation of Weighted Automata with Storage

Tobias Denkinger
2017 Electronic Proceedings in Theoretical Computer Science  
We use a non-deterministic variant of storage types to develop a framework for the approximation of automata with storage.  ...  Language models are often incorporated into systems that have to guarantee a certain response time, e.g. translation systems or speech recognition systems.  ...  is associated with a weight from a semiring.  ... 
doi:10.4204/eptcs.256.7 fatcat:rrbj6c53hjgfjffvagtptxbuzu
« Previous Showing results 1 — 15 out of 515 results