Filters








27,205 Hits in 3.4 sec

ACGreGate: A Framework for Practical Access Control for Applications using Weakly Consistent Databases [article]

Mathias Weber, Annette Bieniusa
2018 arXiv   pre-print
We present ACGreGate, a Java framework for implementing correct access control layers for applications using weakly consistent data stores.  ...  In this paper, we discuss the problem of how to develop an access control layer for applications using weakly consistent data stores without loosing the performance benefits gained by using weaker consistency  ...  Wobber et. al [21] present an access control model for weakly consistent, mutually distrustful replicated systems.  ... 
arXiv:1801.07005v1 fatcat:viqyufcs4ngg7n7slm7asta7vu

Familial Clustering For Weakly-labeled Android Malware Using Hybrid Representation Learning

Yanxin Zhang, Yulei Sui, Shirui Pan, Zheng Zheng, Baodi Ning, Ivor Tsang, Wanlei Zhou
2019 IEEE Transactions on Information Forensics and Security  
We have evaluated our approach using 5,416 ground-truth malware from Drebin and 9,000 malware from VIRUSSHARE (uploaded between Mar. 2017 and Feb. 2018), consisting of 3324 weakly-labeled malware.  ...  The state-of-the-art Android malware clustering approaches rely heavily on the raw labels from commercial AntiVirus (AV) vendors, which causes misclustering for a substantial number of weakly-labeled malware  ...  We would like to thank the anonymous reviewers for their helpful comments.  ... 
doi:10.1109/tifs.2019.2947861 fatcat:yps5spdsyresnepfjqi4kz236m

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [article]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 arXiv   pre-print
But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naively transplant  ...  In this paper, we tackle these issues by proposing appropriate semantics and specifications for highly-concurrent libraries in a weakly-consistent, replicated setting.  ...  But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naïvely transplant  ... 
arXiv:2004.10158v1 fatcat:mon343fb6fff5gubcqvoy2qyvy

MAVEN: modular aspect verification and interference analysis

Max Goldman, Emilia Katz, Shmuel Katz
2010 Formal methods in system design  
The approach is based on model checking of a state machine constructed using the linear temporal logic (LTL) description of the assumptions, a description of the join-points, and the state machine of the  ...  The individual correctness proofs along with proofs of interference freedom are appropriate for a library of reusable aspects, when multiple aspects are to be woven to a system.  ...  In many cases (see [18] ), the aspect can be shown weakly invasive for any base machine satisfying its assumption P , by using local model checking, additional information (our reasoning in the discount  ... 
doi:10.1007/s10703-010-0101-1 fatcat:lylvusrz4rbuzjxdnh6mabwduu

Reentrant Readers-Writers: A Case Study Combining Model Checking with Theorem Proving [chapter]

Bernard van Gastel, Leonard Lensink, Sjaak Smetsers, Marko van Eekelen
2009 Lecture Notes in Computer Science  
We modeled it using a model checker revealing a serious error: a possible deadlock situation. The model was improved and checked satisfactorily for a fixed number of processes.  ...  Such nesting is useful when a library is created with various procedures that each start and end with a lock. Allowing nesting makes it possible for these procedures to call each other.  ...  Acknowledgements We would like to thank both Erik Poll and the anonymous referees of an earlier version of this paper for their useful comments improving the presentation of this work.  ... 
doi:10.1007/978-3-642-03240-0_10 fatcat:p65uzaiuhzbntg4npjl5n7sq2a

MixT: a language for mixing consistency in geodistributed transactions

Matthew Milano, Andrew C. Myers
2018 Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation - PLDI 2018  
For applications that mix accesses to strongly and weakly consistent data, programmers must currently choose between bad performance and possible data corruption.  ...  Compile-time checking ensures that mixing consistency levels is safe: the guarantees of each object's consistency level are enforced.  ...  The authors would like to than Ethan Cecchetti for his help configuring PostgreSQL, and Nate Nystrom for discussions about information flow and consistency.  ... 
doi:10.1145/3192366.3192375 dblp:conf/pldi/MilanoM18 fatcat:5zpsubpkhrd2jbwfwmha6qtcdq

Efficient Strongly Relational Polyhedral Analysis [chapter]

Sriram Sankaranarayanan, Michael A. Colón, Henny Sipma, Zohar Manna
2005 Lecture Notes in Computer Science  
We have implemented a strongly relational polyhedral analyzer for a subset of the C language. Initial experimental results on benchmark examples are encouraging.  ...  Weakly relational domains such as intervals and octagons address the scalability issue by considering polyhedra whose constraints are drawn from a restricted, user-specified class.  ...  Aaron Bradley for implementing the πVC front end, the reviewers for their incisive comments and to the developers of the PPL [2] and GLPK [15] libraries.  ... 
doi:10.1007/11609773_8 fatcat:as2pkl7ppvfgbm4qexba34pore

Reasoning About Actions Using Description Logics with General TBoxes [chapter]

Hongkai Liu, Carsten Lutz, Maja Miličić, Frank Wolter
2006 Lecture Notes in Computer Science  
However, existing DL action formalisms fail to include general TBoxes, which are the standard tool for formalising ontologies in modern description logics.  ...  We would like to thank Giuseppe De Giacomo for ideas and discussions. The first author was supported by the DFG Project BA1122/10-2.  ...  We say that -α is weakly consistent with T iff there are models I, I of T such that I |= pre and I ⇒ T α I .  ... 
doi:10.1007/11853886_23 fatcat:25bxiylhjzhhnm3j6dsx5obobe

Service Discovery Using Communication Fingerprints [chapter]

Olivia Oanea, Jan Sürmeli, Karsten Wolf
2010 Lecture Notes in Computer Science  
Upon request, we use the fingerprint to rule out as many as possible incompatible services thus reducing the number of candidates that need to be model checked for behavioral compatibility.  ...  It consists of computing an abstraction of the behavior for each published service that we call communication fingerprint.  ...  For this reason, we experimented with separate sample sets, one for each library. For all model checking tasks, we used LoLA [11] .  ... 
doi:10.1007/978-3-642-17358-5_46 fatcat:tbtuvpbczrcghmsbtnmvz4owha

Incremental analysis of interference among aspects

Emilia Katz, Shmuel Katz
2008 Proceedings of the 7th workshop on Foundations of aspect-oriented languages - FOAL '08  
An incremental proof strategy based on model checking pairs of aspects for a generic model expressing the specifications is defined.  ...  Such checks for each pair of aspects are proven sufficient to detect interference or establish interference freedom for any order of application of any collection of aspects in a library.  ...  If the model we are model-checking is infinite, or finite but too large, the model-checking will collapse without providing any answer.  ... 
doi:10.1145/1394496.1394500 dblp:conf/foal/KatzK08 fatcat:owsn2kossbd47omdt67edezw6y

Semantics, Specification, and Bounded Verification of Concurrent Libraries in Replicated Systems [chapter]

Kartik Nagar, Prasita Mukherjee, Suresh Jagannathan
2020 Lecture Notes in Computer Science  
But, identifying a suitable notion of correctness to check their validity under a weakly consistent execution model has not been well-studied, in large part because it is problematic to naïvely transplant  ...  In this paper, we tackle these issues by proposing appropriate semantics and specifications for highly-concurrent libraries in a weakly-consistent, replicated setting.  ...  We thank the anonymous reviewers for their insightful comments. This material is based upon work supported by the National Science Foundation under Grant No. CCF-SHF 1717741.  ... 
doi:10.1007/978-3-030-53288-8_13 fatcat:3wx2jru3wvaynhdsufpy7gl5my

Sequential Feature Classification in the Context of Redundancies [article]

Lukas Pfannschmidt, Barbara Hammer
2020 arXiv   pre-print
In this work, we present a new solution for this distinction in the non-linear case through the use of random forest models and statistical methods.  ...  Weakly Strongly FRI SQ FRI SQ  ...  We can check for strong relevance by repeatedly fitting models and checking the behaviour of the loss function similar to the approach in [NBT] .  ... 
arXiv:2004.00658v2 fatcat:2k36qo62ijcg5nk3rs2iuaqurm

CISE3: Verifying Weakly Consistent Applications with Why3 [article]

Filipe Meirim and Mário Pereira and Carla Ferreira
2020 arXiv   pre-print
In this paper we present a tool for the formal analysis of applications built on top of replicated databases, where data integrity can be at stake.  ...  Our tool analyses a sequential specification and deduces which operations require synchronization in order for the program to safely execute in a distributed environment.  ...  This logic presents the concept of a generic consistency model where a wide range of consistency models can be expressed, like weak consistency or strong consistency, for each operation of the application  ... 
arXiv:2010.06622v1 fatcat:mvndfb2k4jfkvbbkctixem6hoi

A graph-based data quality analysis in distributed telemedicine systems

Zoltán Richárd Jánki
2021 Pollack Periodica  
As the amount of data and demand for features increase, the data paths are becoming ever-more complex.  ...  Owing to this, it is vital in telemedicine to find a proper balance between consistency and availability under any given circumstances.  ...  The correctness of system model is verified with a model checker and the state graph is dumped into graph files; Visualizing the new metrics for reliability of data: the model checking results in a state  ... 
doi:10.1556/606.2021.00389 fatcat:cp2eanujzbfi3cezgtwqntcah4

OpenNWA: A Nested-Word Automaton Library [chapter]

Evan Driscoll, Aditya Thakur, Thomas Reps
2012 Lecture Notes in Computer Science  
This paper describes OpenNWA, a C++ library for working with NWAs. The library provides the expected automata-theoretic operations, such as intersection, determinization, and complementation.  ...  For instance, VPAlib does not support concatenation, complementation (although it does support determinization), checking emptiness, or obtaining an example word.  ...  VPAlib [9] is a general-purpose library implementing VPAs. However, Open-NWA's implementation is far more complete.  ... 
doi:10.1007/978-3-642-31424-7_47 fatcat:y7efqdwq3vhaxfq66v5lqv4gee
« Previous Showing results 1 — 15 out of 27,205 results