Filters








10,185 Hits in 2.7 sec

Literature Analysis on Model based Slicing

Rupinder Singh, Vinay Arora
2013 International Journal of Computer Applications  
This literature analysis presents an overview of Model based slicing, including the various general approaches and techniques used to compute slices.  ...  One way to ease this is program slicing technique that decomposes the large programs into smaller ones and another is model based slicing that decomposes the large software architecture model into smaller  ...  Using Model Languages Kim [33] [34] introduced the slicing technique called dynamic software architecture slicing (DSAS).  ... 
doi:10.5120/12155-8185 fatcat:grjopbfjkja47ajvtdhryhleia

Declarative aspects of memory management in the concurrent collections parallel programming model

Zoran Budimlic, Aparna M. Chandramowlishwaran, Kathleen Knobe, Geoff N. Lowney, Vivek Sarkar, Leo Treggiari
2008 Proceedings of the 4th workshop on Declarative aspects of multicore programming - DAMP '09  
We introduce a new declarative slicing annotation for CnC that can be transformed into a reference counting procedure for memory management.  ...  Concurrent Collections (CnC) [8] is a declarative parallel language that allows the application developer to express their parallel application as a collection of high-level computations called steps that  ...  Slicing Annotation The Concurrent Collections Programming Model described in the previous section allows expression of very general forms of dynamic parallelism and dynamic data accesses, while still preserving  ... 
doi:10.1145/1481839.1481846 dblp:conf/popl/BudimlicCKLST09 fatcat:osevp5c4djbenfirfkpvsij2cu

An Assertion language for slicing Constraint Logic Languages [article]

Moreno Falaschi, Carlos Olarte
2018 arXiv   pre-print
Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints in a shared store.  ...  Constraint Logic Programming (CLP) is a language scheme for combining two declarative paradigms: constraint solving and logic programming.  ...  Acknowledgments We thank the anonymous reviewers for their detailed and very useful criticisms and recommendations that helped us to improve our paper. The work of Olarte was sup-  ... 
arXiv:1808.04867v3 fatcat:z7irqpodr5blpmh2ebct3rv56q

Dependence Graph Based Verification and Synthesis of Hardware/Software Co-Designs with SAT Related Formulation

Masahiro Fujita, Kenshu Seto, Thanyapat Sakunkonchak, Miroslav N. Velev
2008 Journal on Satisfiability, Boolean Modeling and Computation  
We have developed a program slicing tool for SpecC, a C-based system level design language for hardware/software co-designs, on top of a program slicer for C/C++.  ...  We first present techniques for checking synchronization among concurrent processes described in SpecC through symbolic analysis on SDGs.  ...  As for slicing of programs that include concurrent executions, Clarke et al. developed a slicing tool for simulation-oriented hardware descriptions in VHDL [8] .  ... 
doi:10.3233/sat190052 fatcat:veodb2n6drfeley56rxclftoq4

A practical approach for model based slicing

Rupinder Singh
2013 IOSR Journal of Computer Engineering  
The proposed methodology use the concept of model based slicing to slice the sequence diagram to extract the desired chunk.  ...  Kim [22] [23] introduced the slicing technique called dynamic software architecture slicing (DSAS) using ADL (Architecture description language).  ...  [9] propose a technique for constructing dynamic slices of UML models using the integrated state-based information.  ... 
doi:10.9790/0661-1241826 fatcat:qzhx6k73jnef7fj22bpctkt4dm

Slicing Concurrent Constraint Programs [article]

Moreno Falaschi, Maurizio Gabbrielli, Carlos Olarte, Catuscia Palamidessi
2017 arXiv   pre-print
Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store.  ...  Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debugging concurrent programs remains difficult.  ...  We thank the anonymous reviewers for their detailed comments and suggestions which helped us to improve our paper. The work of Olarte was funded by CNPq (Brazil).  ... 
arXiv:1608.05252v2 fatcat:jlqfd5v4v5eo7dzkev4zapee3e

Slicing of Constraint Logic Programs [article]

Gyongyi Szilagyi, Tibor Gyimothy, Jan Maluszynski
2000 arXiv   pre-print
Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable.  ...  This paper formulates declarative notions of slice suitable for CLP. They provide a basis for defining slicing techniques (both dynamic and static) based on variable sharing.  ...  for a specific program input (dynamic slice).  ... 
arXiv:cs/0012014v1 fatcat:u4veb33eyzcntljz2o3zmo4aki

Static path conditions for Java

Christian Hammer, Rüdiger Schaade, Gregor Snelting
2008 Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security - PLAS '08  
Object oriented languages offer additional constructs such as dynamic dispatch, instanceof and exceptions.  ...  A static path condition is a precise necessary condition for information flow between two program points. Previous work defined path conditions for procedural languages.  ...  Acknowledgments We would like to thank Torsten Robschink and Jens Krinke for help on extending their implementation of Valsoft. Andreas Lochbihler and the anonymous reviewers provided useful comments.  ... 
doi:10.1145/1375696.1375704 dblp:conf/pldi/HammerSS08 fatcat:fjvek2bdmrcg7px33yufgy6u5i

Interprocedural static analysis of sequencing constraints

Kurt M. Olender, Leon J. Osterweil
1992 ACM Transactions on Software Engineering and Methodology  
This paper describes a system that automatically performs static interprocedural sequencing analysis from programmable constraint specifications.  ...  We describe the algorithms used for interprocedural analysis, relate the problems arising from the analysis of real-world programs, and show how these difficulties were overcome.  ...  Concurrent Program Evaluation The sequencing evaluation of concurrent programs has received attention from both static and dynamic analysts.  ... 
doi:10.1145/125489.122822 fatcat:psitpump3rbu7c7fycjfnaknbm

Weight prioritized slicing based on constraint logic programming for fault localization

Shengbing Ren, Weijia Zhou, Haiwei Zhou, Lei Xia, Baogui Xin
2020 PLoS ONE  
In this paper, we propose a new technique called weight prioritized slicing(WP-Slicing), an improved static slicing technique based on constraint logic programming, to help the programmer locate the fault  ...  Finally, WP-Slicing provides the slice in a suggested check sequence by weighted-sorting.  ...  Due to the technology foundation of these methods is dynamic slicing, there is no meaning to compare them with our method. [19] uses constraint analysis concurrently with slicing.  ... 
doi:10.1371/journal.pone.0231331 pmid:32275731 fatcat:yjbmp5hkmzez7l4hsnftxopiky

IF-2.0: A Validation Environment for Component-Based Real-Time Systems [chapter]

Marius Bozga, Susanne Graf, Laurent Mounier
2002 Lecture Notes in Computer Science  
on time constraints.  ...  Dynamic Extended Automata The formal basis for the IF-2.0 intermediate representation is a dynamic version of extended timed automata.  ... 
doi:10.1007/3-540-45657-0_26 fatcat:l7wh523icja6hgfavppspjpkae

Temporal Data Model for Program Debugging

Demian Lessa, Bharat Jayaraman, Jan Chomicki
2011 International Workshop/Symposium on Database Programming Languages  
We present a novel approach to program debugging and dynamic program analysis based on a temporal data model and query language.  ...  This work forms part of a larger research project in developing JIVE, a state-of-the-art dynamic analysis and visualization system for Java.  ...  The tool uses dynamic slicing [1] to precompute queries and their answers.  ... 
dblp:conf/dbpl/LessaJC11 fatcat:nvgzghld2nbq3kfenughmbsd74

Gobra: Modular Specification and Verification of Go Programs [chapter]

Felix A. Wolf, Linard Arquint, Martin Clochard, Wytse Oortwijn, João C. Pereira, Peter Müller
2021 Lecture Notes in Computer Science  
AbstractGo is an increasingly-popular systems programming language targeting, especially, concurrent and distributed systems.  ...  Go differentiates itself from other imperative languages by offering structural subtyping and lightweight concurrency through goroutines with message-passing communication.  ...  We introduced Gobra, the first modular verifier for Go that supports reasoning about a crucial aspect of the language: the combination of channel-based concurrency and heap-manipulating constructs.  ... 
doi:10.1007/978-3-030-81685-8_17 fatcat:ytkrbungsjffhg7iasi5quhh7u

Page 494 of Mathematical Reviews Vol. , Issue 99a [page]

1991 Mathematical Reviews  
De Amo, A first step towards implementing dynamic algebraic dependen- cies (308-321); Marianne Baudinet, Jan Chomicki and Pierre Wolper, Constraint-generating dependencies (322-337); Venky Harinarayan  ...  Sazonov and Alexei Lisitsa, A-languages for sets and sub-PTIME graph transformers (125-138).  ... 

Protocol Specialization [chapter]

Matthias Neubauer, Peter Thiemann
2004 Lecture Notes in Computer Science  
Our framework models components at the intermediate language level as systems of concurrent functional processes which communicate via channels.  ...  The resulting specialization algorithm is unique in that it processes a concurrent base language, terminates always, and is guaranteed not to expand the program beyond its original size.  ...  The most recent reference deals with a highly specialized area, concurrent constraint languages [7] .  ... 
doi:10.1007/978-3-540-30477-7_17 fatcat:dxcr3gsttfaaxdl5qmkh7lspn4
« Previous Showing results 1 — 15 out of 10,185 results