A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Event-Driven Extraction of HTTP Payload From Concurrent Streams
2014
Journal of Software
Preserved Fulltext
Based on this analysis, we propose a parsing algorithm for concurrent HTTP response streams, built upon stack buffer peeking operations and the extended finite state machine model. ...
Our scheme is event-driven, does not require full buffering of the whole HTTP message, and saves one memory copy compared to naive static parsing method. ...
Extended Finite State Machine A finite state machine(FSM) [12] is a tool used to model finite number of object states and transitions between the states. ...
doi:10.4304/jsw.9.10.2579-2585
fatcat:xmioji33hjgvhfptkuxh6onuj4
Mining message sequence graphs
2011
Proceeding of the 33rd international conference on Software engineering - ICSE '11
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose a framework for mining partial orders so as to understand concurrent program behavior. ...
However, mining program behavior from execution traces is difficult for concurrent/distributed programs. ...
scenarios out of static traces generated from program code. ...
doi:10.1145/1985793.1985807
dblp:conf/icse/KumarKRL11
fatcat:zh73t36gg5elxdfumf6byhmbga
Natural proofs for asynchronous programs using almost-synchronous reductions
2014
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The high point of our experiments is that our technique can prove the Windows Phone USB Driver written in P [9] correct for the responsiveness property, which was hitherto not provable using state-of-the-art ...
The reduction finds almostsynchronous invariants and simultaneously argues that they cover all local states. ...
Acknowledgments The second and third authors were partially funded by the NSF Expeditions in Computing ExCAPE Award #1138994. ...
doi:10.1145/2714064.2660211
fatcat:j7jwqmewrjfdbjc3k62itxtfdm
Natural proofs for asynchronous programs using almost-synchronous reductions
2014
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications - OOPSLA '14
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The high point of our experiments is that our technique can prove the Windows Phone USB Driver written in P [9] correct for the responsiveness property, which was hitherto not provable using state-of-the-art ...
The reduction finds almostsynchronous invariants and simultaneously argues that they cover all local states. ...
Acknowledgments The second and third authors were partially funded by the NSF Expeditions in Computing ExCAPE Award #1138994. ...
doi:10.1145/2660193.2660211
dblp:conf/oopsla/Desai0M14
fatcat:phwakenfozhjzkefcf7dhoemju
FunState-an internal design representation for codesign
2001
IEEE Transactions on Very Large Scale Integration (vlsi) Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
using a mixture of functional programming and state machines. ...
Examples of methods suited for FunState are described, such as scheduling and verification. They are based on the representation of the model's state transitions in form of a periodic graph. ...
Communicating Finite State Machines In the case of a communicating finite state machine, e.g., as in SDL process networks [31] , asynchronously operating finite state machines communicate via FIFO ordered ...
doi:10.1109/92.931229
fatcat:w3ngg4spgzbdbmgsbzjflvdgde
Construction of global finite state machine for testing task interactions written in message sequence charts
2002
Proceedings of the 14th international conference on Software engineering and knowledge engineering - SEKE '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In order to conduct integration testing in a cost-effective manner, it is essential that requirements are captured in precise notation and that test cases are automatically generated and executed whenever ...
In order to reduce the states of the GFSM, an initial state of the system is used to generate only the feasible states from that. ...
In this paper, we demonstrate how to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent global finite state machine (GFSM). ...
doi:10.1145/568823.568825
fatcat:jryf6el5n5bllkxtlfuauwfhgy
Construction of global finite state machine for testing task interactions written in message sequence charts
2002
Proceedings of the 14th international conference on Software engineering and knowledge engineering - SEKE '02
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In order to conduct integration testing in a cost-effective manner, it is essential that requirements are captured in precise notation and that test cases are automatically generated and executed whenever ...
In order to reduce the states of the GFSM, an initial state of the system is used to generate only the feasible states from that. ...
In this paper, we demonstrate how to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent global finite state machine (GFSM). ...
doi:10.1145/568760.568825
dblp:conf/seke/LeeKC02
fatcat:c4ae2atan5gldegkp4ywfefeki
Towards the Integration of Visual and Formal Models for GUI Testing
2007
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The adequacy of the test cases generated automatically from the formal model is accessed based on the structural coverage of the UML behavioural diagrams. ...
., Spec ), hiding formal details from the testers. Then, additional behaviour may be added to the formal model to be used as a test oracle. ...
steps: first, a finite state machine (FSM) is extracted from the explicit Spec specification by bounded exploration of its usually infinite state space; then, test cases are generated from the FSM according ...
doi:10.1016/j.entcs.2007.08.010
fatcat:677ccah7ojhbbb3yx467znm4li
Generating test sequences from a set of MSCs
2003
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We use scenario activation conditions and state assignments to generate only the feasible states and transitions. ...
We propose an approach to generate test cases from a set of Message Sequence Charts (MSCs) by constructing a semantically equivalent finite state machine for testing reactive and embedded software. ...
Acknowledgements Partially supported by the Advanced Information Technology Research Center (AITrc). ...
doi:10.1016/s1389-1286(03)00250-0
fatcat:aguy6hqwsfbthloornvzvzage4
Generalization/specialization and role in object oriented conceptual modeling
1996
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Decision criteria on the use of generalization/specialization are discussed and a formal taxonomy of processes corresponding to the generalization/specialization hierarchy is presented. ...
The "IS A"-relationship and the mechanism of inheritance are powerful concepts that help to reduce complexity of models and redundancy in specifications. ...
This paper uses Finite State Machines (FSMs) as technique for behaviour modeling, just as most OOA-methods. ...
doi:10.1016/0169-023x(95)00044-s
fatcat:sjikdwlvgrfgzcctuu4qbfedvm
Using partial-orders for detecting faults in concurrent systems
[chapter]
1998
Testing of Communicating Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using a partial-order model, called Mazurkiewicz Trace Machine (MTM), for test derivation, the state explosion problem can be alleviated. ...
A scenario of test execution in concurrent systems, including a suitable test architecture, is discussed that explains the application of a test suite derived from an MTM in a test run. ...
In [16] , an hierarchy-based finite state machine (FSM) construction approach is used to perform a structural test ofa system consisting of several concurrent FSMs. ...
doi:10.1007/978-0-387-35381-4_11
fatcat:g6z4nbpk35gyfcyaggrnhjyh3q
Towards a "Synchronous Reactive" UML profile?
2005
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Still, the generic paradigms underlying these modeling efforts is that of software components, running on a real-time OSs with physical time constraints and middleware (e.g., RT-Corba) concerns. ...
Still, the generic paradigms underlying these modeling efforts is that of software components, running on a real-time OSs with physical time constraints and middleware (e.g., RT-Corba) concerns. ...
They can also derive a partial order compatible with all the partial orders underlying each possible reaction. From this partial order a static scheduling for all the actions is then proposed. ...
doi:10.1007/s10009-005-0206-9
fatcat:e5qswalm6nfq7nnwvbuejleine
Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141)
2013
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In order to tighten the gap between the involved communities, who have been quite separated in the past, the program contained tutorials on the basics of the concerned fields. ...
The Dagstuhl Seminar 13141 "Formal Verification of Distributed Algorithms" brought together researchers from the areas of distributed algorithms, model checking, and semi-automated proofs with the goal ...
Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. ...
doi:10.4230/dagrep.3.4.1
dblp:journals/dagstuhl-reports/Charron-BostMRW13
fatcat:huhbi7pdkvfafg5dpmc7ikyffi
Concurrent engineering in design of aircraft structures
1995
Journal of Aircraft
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Mathematical optimization algorithms, finite element methods for structures, and panel methods for aerodynamics build up the basis for optimization calculations with a high rate of generality and efficiency ...
For our sensitivity analysis using the finite difference method, we have chosen a 10% perturbation magnitude on the aerodynamic design variables (Fig. 9). ...
doi:10.2514/3.46733
fatcat:7e3cmkorabcezekrns6nfpu4bq
Machine Learning for Dynamic Software Analysis: Potentials and Limits (Dagstuhl Seminar 16172)
2016
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
There exist already some works that incorporate domain information generated by static analysis (e.g., for partial order reduction on the alphabet). ...
In order to achieve true practicality, automata learning has 1) to increase scalability, 2) to move from its original theoretical roots, which focused on standard finite state machines to more expressive ...
doi:10.4230/dagrep.6.4.161
dblp:journals/dagstuhl-reports/BennaceurGHM16
fatcat:7t3jl5y7dfanfjeev3k42nmfau
« Previous
Showing results 1 — 15 out of 10,488 results