Filters








43,785 Hits in 4.1 sec

A Compositional Sweep-Line State Space Exploration Method [chapter]

Lars Michael Kristensen, Thomas Mailund
2002 Lecture Notes in Computer Science  
The sweep-line method exploits a certain kind of progress present in many systems to reduce peak memory usage during state space exploration.  ...  State space exploration is a main approach to verification of finite-state systems.  ...  The sweep-line method and state space caching both guarantee complete coverage of the state space, i.e., exploration of all reachable states.  ... 
doi:10.1007/3-540-36135-9_21 fatcat:xg3crkf4ija4lnun2ffp3dr5ni

The sweep-line state space exploration method

Kurt Jensen, Lars M. Kristensen, Thomas Mailund
2012 Theoretical Computer Science  
The sweep-line method exploits intrinsic progress in concurrent systems to alleviate the state explosion problem in explicit state model checking.  ...  Second, we survey a selection of case studies where the sweep-line method has been put into practical use for the verification of concurrent systems.  ...  Acknowledgements The sweep-line method has been influenced by several co-authors of papers. In particular, we acknowledge the contributions of Jonathan Billington, Søren Christensen, Guy E.  ... 
doi:10.1016/j.tcs.2011.12.036 fatcat:ajwaohtrgzffzkrngki7vcjgcm

Checking safety properties on-the-fly with the sweep-line method

Guy Edward Gallasch, Jonathan Billington, Somsak Vanit-Anunchai, Lars Michael Kristensen
2007 International Journal on Software Tools for Technology Transfer (STTT)  
: Distributed model checking: State space exploration is conducted using a set of machines / processes.  ...  a a h 4 Compressed state descriptor CPN'09 -7 Reconstruction of full state descriptors to resolve hash collisions during state space exploration.  ...  Example: Partition Refinement Heuristics The refinement step requires the selection of state component to be used for the refinement.  ... 
doi:10.1007/s10009-007-0031-4 fatcat:4zx4q74c2zb2dewowqvs4v3c24

Scqubits: a Python package for superconducting qubits

Peter Groszkowski, Jens Koch
2021 Quantum  
Many of these tools are not limited to single qubits, but extend to composite Hilbert spaces consisting of coupled superconducting qubits and harmonic (or weakly anharmonic) modes.  ...  The library provides an extensive suite of methods for estimating qubit coherence times due to a variety of commonly considered noise channels.  ...  You, and A. Zheng for code contributions and bug reports. Continuing development of scqubits is currently supported by the AFOSR under grant FA9550-20-1-0271.  ... 
doi:10.22331/q-2021-11-17-583 fatcat:vx4lhvrzrbdnffslym76dumuqe

Scqubits: a Python package for superconducting qubits [article]

Peter Groszkowski, Jens Koch
2021 arXiv   pre-print
Many of these tools are not limited to single qubits, but extend to composite Hilbert spaces consisting of coupled superconducting qubits and harmonic (or weakly anharmonic) modes.  ...  The library provides an extensive suite of methods for estimating qubit coherence times due to a variety of commonly considered noise channels.  ...  You, and A. Zheng for code contributions and bug reports. Continuing development of scqubits is currently supported by the AFOSR under grant FA9550-20-1-0271.  ... 
arXiv:2107.08552v2 fatcat:g6mu7evkfncifon2fmodnrn4ju

Immix

Stephen M. Blackburn, Kathryn S. McKinley
2008 SIGPLAN notices  
The three canonical tracing garbage collectors: semi-space, mark-sweep, and mark-compact each sacrifice one objective.  ...  The key insight is to allocate and reclaim memory in contiguous regions, at a coarse block grain when possible and otherwise in groups of finer grain lines.  ...  Thus it is a generational semi-space, mark-sweep composite. Because it uses a semi-space for young objects, this collector does not support pinning.  ... 
doi:10.1145/1379022.1375586 fatcat:425brocskrbd5oy6saflivktty

Immix

Stephen M. Blackburn, Kathryn S. McKinley
2008 Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation - PLDI '08  
The three canonical tracing garbage collectors: semi-space, mark-sweep, and mark-compact each sacrifice one objective.  ...  The key insight is to allocate and reclaim memory in contiguous regions, at a coarse block grain when possible and otherwise in groups of finer grain lines.  ...  Thus it is a generational semi-space, mark-sweep composite. Because it uses a semi-space for young objects, this collector does not support pinning.  ... 
doi:10.1145/1375581.1375586 dblp:conf/pldi/BlackburnM08 fatcat:5rnswollkrgwtfxoffhlqd7nza

The Governmentality of Rural Household Waste Management Practices in Ala Ajagbusi, Nigeria

Saheed Adebayo Abdulwakeel, Orjan Bartholdson
2018 Social Sciences  
The results show that villagers collectively, every week in a rotational manner, sweep their households, dispose of, and burn waste in public spaces.  ...  This paper attempts to bridge this gap through a study of waste management practices in Ala Ajagbusi village, Nigeria. The study explores how members of households in Ala Ajagbusi handle waste.  ...  We also appreciate both Muslim Amin and Caitlin McCormack for their efforts and time with a grammar and spelling check. Conflicts of Interest: The authors declare no conflicts of interest.  ... 
doi:10.3390/socsci7060095 fatcat:7n2274ykuvekbi3at352rotsky

A Graphical Approach to Component-Based and Extensible Model Checking Platforms [chapter]

Michael Westergaard, Lars Michael Kristensen
2012 Lecture Notes in Computer Science  
JoSEL makes it possible to work at different levels of abstraction when interacting with the underlying components of a model checking tool and thereby supports the different kinds of users in a uniform  ...  A job can then be mapped onto components of an underlying model checking tool for execution.  ...  bit-state hashing, hash-compaction, full state spaces, the comback method, the sweep-line method, and methods using external storage) (see [18] for details).  ... 
doi:10.1007/978-3-642-29072-5_12 fatcat:diht3q2wibaqhkctl77jqnkh5m

Dynamic tuning of algorithmic parameters of parallel scientific codes

Pilsung Kang, Naresh K.C. Selvarasu, Naren Ramakrishnan, Calvin J. Ribbens, Danesh K. Tafti, Srinidhi Varadarajan
2010 Procedia Computer Science  
We present a dynamic method for tuning algorithmic parameters of parallel scientific programs.  ...  We use a compositional framework to transparently combine tuning code with the original program without direct modification of an existing code base.  ...  For each algorithmic parameter under tuning consideration, exploring a point in the search space takes four stages: stage 1 (line 4-7) initiates measuring performance with the current value, stage 2 (line  ... 
doi:10.1016/j.procs.2010.04.017 fatcat:66bdqk6255bzxdzvy4b6bspdte

Stable isotope analysis using tunable diode laser spectroscopy

Joseph F. Becker, Todd B. Sauke, Max Loewenstein
1992 Applied Optics  
Our dual beam spectrometer uses the sweep integration technique in a spectral region where adjacent spectral lines are of approximately equal absorbance at the expected isotopic abundances.  ...  Measurements of ratios of stable isotopes are used in such diverse fields as petroleum prospecting, medical diagnostics, and planetary exploration.  ...  This research was supported in part by theN ational Aeronautics and Space Administration's (NASA's) Exobiology Flight Program, the Solar System Exploration Branch at NASA Ames Research Center, NASA grant  ... 
doi:10.1364/ao.31.001921 pmid:20720839 fatcat:ifoatuffvzhmznexwh7czc6bgm

Uncovering the Footprint of Positive Selection on the X Chromosome of Drosophila melanogaster

D. J. Orengo, M. Aguade
2009 Molecular biology and evolution  
performance of the two tests of selection under a bottleneck scenario.  ...  Our analysis of variation at these genomic regions in a European population of D. melanogaster has allowed us to uncover a candidate region for positive selection and to empirically evaluate the comparative  ...  Special thanks are given to Aleksandra Gondek for her contribution, as a predoctoral Marie Curie fellow, at the initial stage of this project and to Carmen Segarra and anonymous reviewers for comments  ... 
doi:10.1093/molbev/msp220 pmid:19759233 fatcat:ejdjtn453vfvre4c66oepfahw4

Model-based optimization of ARINC-653 partition scheduling

Pujie Han, Zhengjun Zhai, Brian Nielsen, Ulrik Nyman
2021 International Journal on Software Tools for Technology Transfer (STTT)  
The parameter space is explored with an evolutionary algorithm that combines refined genetic operators and the self-adaptation of evolution strategies.  ...  We formulate the problem as a parameter sweep application, which searches for the optimal partition scheduling parameters with respect to minimum processor occupancy via an evolutionary algorithm.  ...  A parameter sweep optimizer explores the solution space via evolutionary algorithm while guaranteeing the schedulability by model checking.  ... 
doi:10.1007/s10009-020-00597-6 fatcat:gspkrix25fbrjmev4yj73j4qcy

Visual interfaces for solids modeling

Cindy Grimm, David Pugmire
1995 Proceedings of the 8th annual ACM symposium on User interface and software technology - UIST '95  
Additionally, these tools can be manipulated in the same 3D space as the surfaces produced by the operators, supporting quick, interactive exploration of the large design space of these free-form operators  ...  We focus on designing interfaces for free-form operators such as blends, sweeps, and deformations, because these operators have a large number of interacting parameters whose effects are often determined  ...  If the parameter space curve t is a line segment and the surface u; v is planar and the quality of the parameterization is close to isometric [Elb92] , the composite Γt is just a line segment with end  ... 
doi:10.1145/215585.215652 dblp:conf/uist/GrimmP95 fatcat:yhctbzz6bja4jdcqo3n4r2ocfi

Indoor Path Planning using Harmonic Functions via Half-Sweep Arithmetic Mean Method

Saudi Azali
2019 International Journal of Computing and Digital Systems  
This paper presents the application of a two-stage Half-Sweep Arithmetic Mean (HSAM) iterative method to obtain the Harmonic functions to solve the path planning problem in a 2D indoor environment.  ...  Several path planning simulations in a known indoor environment were conducted to examine the effectiveness of the proposed method.  ...  Application in dynamic and unknown environment is an interesting idea to explore in the future. Furthermore, the HSAM method will be examined for path planning problem in space of higher dimensions.  ... 
doi:10.12785/ijcds/080510 fatcat:y57k6lfi6fgudmou7rsjkxjtzm
« Previous Showing results 1 — 15 out of 43,785 results