@conference {17181,
	title = {Group-in-a-Box Layout for Multi-faceted Analysis of Communities},
	booktitle = {Privacy, Security, Risk and Trust (PASSAT), 2011 IEEE Third International Conference on and 2011 IEEE Third International Confernece on Social Computing (SocialCom)},
	year = {2011},
	month = {2011/10/09/11},
	pages = {354 - 361},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Communities in social networks emerge from interactions among individuals and can be analyzed through a combination of clustering and graph layout algorithms. These approaches result in 2D or 3D visualizations of clustered graphs, with groups of vertices representing individuals that form a community. However, in many instances the vertices have attributes that divide individuals into distinct categories such as gender, profession, geographic location, and similar. It is often important to investigate what categories of individuals comprise each community and vice-versa, how the community structures associate the individuals from the same category. Currently, there are no effective methods for analyzing both the community structure and the category-based partitions of social graphs. We propose Group-In-a-Box (GIB), a meta-layout for clustered graphs that enables multi-faceted analysis of networks. It uses the tree map space filling technique to display each graph cluster or category group within its own box, sized according to the number of vertices therein. GIB optimizes visualization of the network sub-graphs, providing a semantic substrate for category-based and cluster-based partitions of social graphs. We illustrate the application of GIB to multi-faceted analysis of real social networks and discuss desirable properties of GIB using synthetic datasets.},
	keywords = {Algorithm design and analysis, category based social graph partitions, clustered graphs, clustering, Clustering algorithms, Communities, data visualisation, force-directed, gender, geographic location, graph layout algorithms, graph theory, group-in-a-box, group-in-a-box layout, Image edge detection, Layout, meta-layout, multifaceted community analysis, network subgraph visualization, network visualization, pattern clustering, profession, semantic substrates, Social network services, social networking (online), social networks, treemap space filling technique, Visualization},
	isbn = {978-1-4577-1931-8},
	doi = {10.1109/PASSAT/SocialCom.2011.139},
	author = {Rodrigues,E.M. and Milic-Frayling,N. and Smith,M. and Shneiderman, Ben and Hansen,D.}
}
@conference {17633,
	title = {New Constructive Aspects of the Lovasz Local Lemma},
	booktitle = {2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS)},
	year = {2010},
	month = {2010/10/23/26},
	pages = {397 - 406},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The Lov{\textquoteright}{a}sz Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of {\textquoteleft}{\textquoteleft}bad{\textquoteright}{\textquoteright} events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser \& Tardos. We show that the output distribution of the Moser-Tardos algorithm well-approximates the emph{conditional LLL-distribution} {\textendash} the distribution obtained by conditioning on all bad events being avoided. We show how a known bound on the probabilities of events in this distribution can be used for further probabilistic analysis and give new constructive and non-constructive results. We also show that when an LLL application provides a small amount of slack, the number of resamplings of the Moser-Tardos algorithm is nearly linear in the number of underlying independent variables (not events!), and can thus be used to give efficient constructions in cases where the underlying proof applies the LLL to super-polynomially many events. Even in cases where finding a bad event that holds is computationally hard, we show that applying the algorithm to avoid a polynomial-sized {\textquoteleft}{\textquoteleft}core{\textquoteright}{\textquoteright} subset of bad events leads to a desired outcome with high probability. We demonstrate this idea on several applications. We give the first constant-factor approximation algorithm for the Santa Claus problem by making an LLL-based proof of Feige constructive. We provide Monte Carlo algorithms for acyclic edge coloring, non-repetitive graph colorings, and Ramsey-type graphs. In all these applications the algorithm falls directly out of the non-constructive LLL-based proof. Our algorithms are very simple, often provide better bounds than previous algorithms, and are in several cases the first efficient algorithms known. As a second type of application we consider settings beyond the critical dependency threshold of the LLL: - - avoiding all bad events is impossible in these cases. As the first (even non-constructive) result of this kind, we show that by sampling from the LLL-distribution of a selected smaller core, we can avoid a fraction of bad events that is higher than the expectation. MAX $k$-SAT is an example of this.},
	keywords = {acyclic edge coloring, Algorithm design and analysis, Approximation algorithms, Approximation methods, computational complexity, Computer science, constant factor approximation algorithm, graph colouring, Linearity, Lovasz Local Lemma, MAX k-SAT, Monte Carlo Algorithm, Monte Carlo methods, Moser-Tardos algorithm, nonrepetitive graph coloring, output distribution, polynomial sized core subset, Polynomials, Probabilistc Method, probabilistic analysis, probabilistic logic, probability, Ramsey type graph, Sampling methods, Santa Claus Problem},
	isbn = {978-1-4244-8525-3},
	doi = {10.1109/FOCS.2010.45},
	author = {Haeupler,B. and Saha,B. and Srinivasan, Aravind}
}
@conference {15269,
	title = {A cooperative combinatorial Particle Swarm Optimization algorithm for side-chain packing},
	booktitle = {IEEE Swarm Intelligence Symposium, 2009. SIS {\textquoteright}09},
	year = {2009},
	month = {2009/04/30/March},
	pages = {22 - 29},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Particle Swarm Optimization (PSO) is a well-known, competitive technique for numerical optimization with real-parameter representation. This paper introduces CCPSO, a new Cooperative Particle Swarm Optimization algorithm for combinatorial problems. The cooperative strategy is achieved by splitting the candidate solution vector into components, where each component is optimized by a particle. Particles move throughout a continuous space, their movements based on the influences exerted by static particles that then get feedback based on the fitness of the candidate solution. Here, the application of this technique to side-chain packing (a proteomics optimization problem) is investigated. To verify the efficiency of the proposed CCPSO algorithm, we test our algorithm on three side-chain packing problems and compare our results with the provably optimal result. Computational results show that the proposed algorithm is very competitive, obtaining a conformation with an energy value within 1\% of the provably optimal solution in many proteins.},
	keywords = {Algorithm design and analysis, Amino acids, combinatorial mathematics, cooperative combinatorial particle swarm optimization algorithm, Design optimization, Encoding, Feedback, numerical optimization, Optimization methods, particle swarm optimisation, Particle swarm optimization, Partitioning algorithms, Proteins, proteomics, proteomics optimization, Robustness, side-chain packing},
	isbn = {978-1-4244-2762-8},
	doi = {10.1109/SIS.2009.4937840},
	author = {Lapizco-Encinas,G. and Kingsford, Carl and Reggia, James A.}
}
@conference {17559,
	title = {Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints},
	booktitle = {IEEE INFOCOM 2008. The 27th Conference on Computer Communications},
	year = {2008},
	month = {2008/04/13/18},
	pages = {1166 - 1174},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which data can be sent on these connections. Most of the research in this direction has focused on either random distributions of points, or has assumed simple graph-based models for wireless interference. In this paper, we study capacity estimation problem using the more general Signal to Interference Plus Noise Ratio (SINR) model for interference, on arbitrary wireless networks. The problem becomes much harder in this setting, because of the non-locality of the SINR model. Recent work by Moscibroda et al. (2006) has shown that the throughput in this model can differ from graph based models significantly. We develop polynomial time algorithms to provably approximate the total throughput in this setting.},
	keywords = {Algorithm design and analysis, approximation algorithm, Approximation algorithms, approximation theory, Computer networks, Computer science, graph theory, graph-based model, Interference constraints, polynomial time algorithm, Propagation losses, Protocols, radio networks, radiofrequency interference, signal to interference plus noise ratio, Signal to noise ratio, Throughput, wireless interference, wireless network, Wireless networks},
	isbn = {978-1-4244-2025-4},
	doi = {10.1109/INFOCOM.2008.172},
	author = {Chafekar,D. and Kumart,V. S.A and Marathe,M. V and Parthasarathy,S. and Srinivasan, Aravind}
}
@article {14620,
	title = {Guest Editors{\textquoteright} Introduction to the Special Section on Algorithms in Bioinformatics},
	journal = {IEEE/ACM Transactions on Computational Biology and Bioinformatics},
	volume = {5},
	year = {2008},
	month = {2008/12//Oct},
	pages = {482 - 483},
	keywords = {Abstracts, Algorithm design and analysis, Bioinformatics, Biological system modeling, biology computing, Computational Biology, Computational modeling, Computer science, Genomics, sequences},
	isbn = {1545-5963},
	doi = {10.1109/TCBB.2008.116},
	author = {Giancarlo,Raffaele and Hannenhalli, Sridhar}
}
@conference {15916,
	title = {A new multiresolution generalized directional filter bank design and application in image enhancement},
	booktitle = {15th IEEE International Conference on Image Processing, 2008. ICIP 2008},
	year = {2008},
	month = {2008/10//},
	pages = {2816 - 2819},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In this paper, we present an image enhancement technique based on a new multiscale generalized directional filter bank design. The design presented is a shift-invariant overcomplete representation, which is well suited to extracting geometric features such as edges. Special cases of this design method can be made to reduce to different and improved implementations of the shearlet and the contourlet transforms, which are known to represent certain classes of images optimally. Use of this new filter bank design has proven itself competitive in image restoration for noisy images and is well suited for distinguishing noise from weak edges. Experimental results show that our unique image enhancement technique out-performs wavelet and contourlet based enhancement methods.},
	keywords = {Algorithm design and analysis, Approximation error, Channel bank filters, contourlet transform, Design methodology, Discrete transforms, Feature extraction, Filter bank, Frequency, geometric feature extraction, Image Enhancement, IMAGE PROCESSING, image resolution, image restoration, Multidimensional digital filters, Multidimensional systems, multiresolution generalized directional filter bank design, shearlet transform, shift-invariant overcomplete representation, transforms, Wavelet transforms},
	isbn = {978-1-4244-1765-0},
	doi = {10.1109/ICIP.2008.4712380},
	author = {Patel, Vishal M. and Easley,G. R and Healy,D. M}
}
@conference {12055,
	title = {Polydioptric camera design and 3D motion estimation},
	booktitle = {2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings},
	volume = {2},
	year = {2003},
	month = {2003/06/18/20},
	pages = {II- 294-301 vol.2 - II- 294-301 vol.2},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Most cameras used in computer vision applications are still based on the pinhole principle inspired by our own eyes. It has been found though that this is not necessarily the optimal image formation principle for processing visual information using a machine. We describe how to find the optimal camera for 3D motion estimation by analyzing the structure of the space formed by the light rays passing through a volume of space. Every camera corresponds to a sampling pattern in light ray space, thus the question of camera design can be rephrased as finding the optimal sampling pattern with regard to a given task. This framework suggests that large field-of-view multi-perspective (polydioptric) cameras are the optimal image sensors for 3D motion estimation. We conclude by proposing design principles for polydioptric cameras and describe an algorithm for such a camera that estimates its 3D motion in a scene independent and robust manner.},
	keywords = {3D motion estimation, Algorithm design and analysis, Application software, CAMERAS, Computer vision, Eyes, field-of-view camera, Image motion analysis, image sampling, image sensor, Image sensors, Layout, light ray, Motion estimation, multiperspective camera, optimal camera, optimal image formation, optimal sampling pattern, pinhole principle, polydioptric camera design, ray space, scene independent estimation, space structure analysis, stereo image processing, visual information processing},
	isbn = {0-7695-1900-8},
	doi = {10.1109/CVPR.2003.1211483},
	author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {13363,
	title = {Decoupled query optimization for federated database systems},
	booktitle = {18th International Conference on Data Engineering, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {716 - 727},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We study the problem of query optimization in federated relational database systems. The nature of federated databases explicitly decouples many aspects of the optimization process, often making it imperative for the optimizer to consult underlying data sources while doing cost-based optimization. This not only increases the cost of optimization, but also changes the trade-offs involved in the optimization process significantly. The dominant cost in the decoupled optimization process is the "cost of costing" that traditionally has been considered insignificant. The optimizer can only afford a few rounds of messages to the underlying data sources and hence the optimization techniques in this environment must be geared toward gathering all the required cost information with minimal communication. In this paper, we explore the design space for a query optimizer in this environment and demonstrate the need for decoupling various aspects of the optimization process. We present minimum-communication decoupled variants of various query optimization techniques, and discuss tradeoffs in their performance in this scenario. We have implemented these techniques in the Cohera federated database system and our experimental results, somewhat surprisingly, indicate that a simple two-phase optimization scheme performs fairly well as long as the physical database design is known to the optimizer, though more aggressive algorithms are required otherwise},
	keywords = {Algorithm design and analysis, Cohera federated database, Computer science, Corporate acquisitions, Cost function, Database systems, decoupled optimization, Design optimization, distributed databases, federated databases, federated relational database systems, Internet, Query optimization, query optimizer, Query processing, Relational databases, Space exploration},
	isbn = {0-7695-1531-2},
	doi = {10.1109/ICDE.2002.994788},
	author = {Deshpande, Amol and Hellerstein,J. M}
}
@conference {14219,
	title = {Eyes from eyes: new cameras for structure from motion},
	booktitle = {Third Workshop on Omnidirectional Vision, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {19 - 26},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We investigate the relationship between camera design and the problem of recovering the motion and structure of a scene from video data. The visual information that could possibly be obtained is described by the plenoptic function. A camera can be viewed as a device that captures a subset of this function, that is, it measures some of the light rays in some part of the space. The information contained in the subset determines how difficult it is to solve subsequent interpretation processes. By examining the differential structure of the time varying plenoptic function we relate different known and new camera models to the spatiotemporal structure of the observed scene. This allows us to define a hierarchy of camera designs, where the order is determined by the stability and complexity of the computations necessary to estimate structure and motion. At the low end of this hierarchy is the standard planar pinhole camera for which the structure from motion problem is non-linear and ill-posed. At the high end is a new camera, which we call the full field of view polydioptric camera, for which the problem is linear and stable. In between are multiple-view cameras with large fields of view which we have built, as well as catadioptric panoramic sensors and other omni-directional cameras. We develop design suggestions for the polydioptric camera, and based upon this new design we propose a linear algorithm for ego-motion estimation, which in essence combines differential motion estimation with differential stereo.},
	keywords = {Algorithm design and analysis, Camera design, CAMERAS, Design automation, differential stereo, Educational institutions, ego-motion estimation, Eyes, Geometrical optics, IMAGE PROCESSING, Layout, Motion estimation, observed scene, Optical films, polydioptric camera, RETINA},
	isbn = {0-7695-1629-7},
	doi = {10.1109/OMNVIS.2002.1044486},
	author = {Neumann, J. and Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {17588,
	title = {Efficient algorithms for location and sizing problems in network design},
	booktitle = {IEEE Global Telecommunications Conference, 2001. GLOBECOM {\textquoteright}01},
	volume = {4},
	year = {2001},
	month = {2001///},
	pages = {2586-2590 vol.4 - 2586-2590 vol.4},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Large-scale location, sizing and homing problems of distributed network elements, have received much attention recently due to the massive deployment of broadband communication networks for services like Internet telephony and Web caching. Key considerations in designing these networks include modularity of capacity, economies of scale in cost, and reliability. We formulate a general class of such network design problems as Mixed-Integer Programs. These problems are computationally intractable in general; under various asymptotic conditions, we show how to compute near-optimal solutions. To deal with arbitrary instances, we develop new algorithms based on linear programming, as well as greedy randomized adaptive search. These algorithms achieved near-optimal solutions with reasonable computation time for our experiments},
	keywords = {Algorithm design and analysis, Broadband communication, broadband communication networks, broadband networks, capacity modularity, Communication networks, computer network reliability, distributed network elements, Economies of scale, greedy randomized adaptive search, homing, integer programming, Intelligent networks, Internet telephony, large-scale location problems, Large-scale systems, Linear programming, mixed-integer programs, near-optimal solutions, network design, Optical switches, randomised algorithms, reliability, search problems, sizing, Technological innovation, telecommunication network planning, Web caching},
	isbn = {0-7803-7206-9},
	doi = {10.1109/GLOCOM.2001.966243},
	author = {Kumaran,K. and Srinivasan, Aravind and Qiong Wang and Lanning,S. and Ramakrishnan,K. G}
}
@article {17842,
	title = {Visualization of large data sets with the Active Data Repository},
	journal = {IEEE Computer Graphics and Applications},
	volume = {21},
	year = {2001},
	month = {2001/08//Jul},
	pages = {24 - 33},
	abstract = {We implement ray-casting-based volume rendering and isosurface rendering methods using the Active Data Repository (ADR) for visualizing out-of-core data sets. We have developed the ADR object-oriented framework to provide support for applications that employ range queries with user-defined mapping and aggregation operations on large-scale multidimensional data. ADR targets distributed-memory parallel machines with one or more disks attached to each node. It is designed as a set of modular services implemented in C++, which can be customized for application-specific processing. The ADR runtime system supports common operations such as memory management, data retrieval, and scheduling of processing across a parallel machine},
	keywords = {active data repository, ADR runtime system, Algorithm design and analysis, application-specific processing, C++, data mining, data retrieval, data visualisation, Data visualization, distributed-memory parallel machines, Indexing, Information retrieval, isosurface rendering, Isosurfaces, large data sets, large-scale multidimensional data, Memory management, modular services, out-of-core data sets, parallel machine, Parallel machines, Partitioning algorithms, ray-casting-based volume rendering, Rendering (computer graphics), Runtime, software libraries, storage management},
	isbn = {0272-1716},
	doi = {10.1109/38.933521},
	author = {Kurc, T. and Catalyurek,U. and Chang,Chialin and Sussman, Alan and Saltz, J.}
}
@conference {12047,
	title = {Which shape from motion?},
	booktitle = {Sixth International Conference on Computer Vision, 1998},
	year = {1998},
	month = {1998/01/04/7},
	pages = {689 - 695},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {In a practical situation, the rigid transformation relating different views is recovered with errors. In such a case, the recovered depth of the scene contains errors, and consequently a distorted version of visual space is computed. What then are meaningful shape representations that can be computed from the images? The result presented in this paper states that if the rigid transformation between different views is estimated in a way that gives rise to a minimum number of negative depth values, then at the center of the image affine shape can be correctly computed. This result is obtained by exploiting properties of the distortion function. The distortion model turns out to be a very powerful tool in the analysis and design of 3D motion and shape estimation algorithms, and as a byproduct of our analysis we present a computational explanation of psychophysical results demonstrating human visual space distortion from motion information},
	keywords = {3D motion estimation, affine shape, Algorithm design and analysis, Computer vision, distorted version, distortion function, human visual space distortion, HUMANS, Image motion analysis, image representation, Information analysis, Layout, Motion analysis, Motion estimation, motion information, Psychology, rigid transformation, SHAPE, shape estimation, shape representations, State estimation, visual space},
	isbn = {81-7319-221-9},
	doi = {10.1109/ICCV.1998.710792},
	author = {Ferm{\"u}ller, Cornelia and Aloimonos, J.}
}
@conference {17056,
	title = {Design and evaluation of incremental data structures and algorithms for dynamic query interfaces},
	booktitle = {IEEE Symposium on Information Visualization, 1997. Proceedings},
	year = {1997},
	month = {1997/10/21/21},
	pages = {81 - 86},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {A dynamic query interface (DQI) is a database access mechanism that provides continuous real-time feedback to the user during query formulation. Previous work shows that DQIs are elegant and powerful interfaces to small databases. Unfortunately, when applied to large databases, previous DQI algorithms slow to a crawl. We present a new incremental approach to DQI algorithms and display updates that work well with large databases, both in theory and in practice.},
	keywords = {Algorithm design and analysis, Bars, Computer science, continuous real-time feedback, Data structures, data visualisation, Data visualization, database access mechanism, Displays, DQI algorithms, dynamic query interfaces, Feedback, Graphical user interfaces, Heuristic algorithms, incremental data structures, Information Visualization, large databases, Manipulator dynamics, NASA, query formulation, query languages, Query processing, real-time systems, small databases, User interfaces, very large databases, visual databases, visual languages},
	isbn = {0-8186-8189-6},
	doi = {10.1109/INFVIS.1997.636790},
	author = {Tanin,E. and Beigel,R. and Shneiderman, Ben}
}
@conference {12787,
	title = {Efficient on-the-fly model checking for CTL},
	booktitle = {, Tenth Annual IEEE Symposium on Logic in Computer Science, 1995. LICS {\textquoteright}95. Proceedings},
	year = {1995},
	month = {1995/06/26/29},
	pages = {388 - 397},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper gives an on-the-fly algorithm for determining whether a finite-state system satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches that of the best existing {\textquotedblleft}global algorithm{\textquotedblright} for model checking in this logic, and it performs as well as the best known global algorithms for the sublogics CTL and LTL. In contrast with these approaches, however, our routine constructs the state space of the system under consideration in a need-driven fashion and will therefore perform better in practice},
	keywords = {Algorithm design and analysis, Automata, computational complexity, Computer science, CTL, Encoding, finite automata, finite-state system, global algorithm, Logic, LTL, on-the-fly model checking, Performance analysis, Safety, State-space methods, sublogic, temporal logic, time complexity},
	isbn = {0-8186-7050-9},
	doi = {10.1109/LICS.1995.523273},
	author = {Bhat,G. and Cleaveland, Rance and Grumberg,O.}
}
@article {16378,
	title = {Going beyond integer programming with the Omega test to eliminate false data dependences},
	journal = {IEEE Transactions on Parallel and Distributed Systems},
	volume = {6},
	year = {1995},
	month = {1995/02//},
	pages = {204 - 211},
	abstract = {Array data dependence analysis methods currently in use generate false dependences that can prevent useful program transformations. These false dependences arise because the questions asked are conservative approximations to the questions we really should be asking. Unfortunately, the questions we really should be asking go beyond integer programming and require decision procedures for a subclass of Presburger formulas. In this paper, we describe how to extend the Omega test so that it can answer these queries and allow us to eliminate these false data dependences. We have implemented the techniques described here and believe they are suitable for use in production compilers},
	keywords = {Algorithm design and analysis, Arithmetic, Computer science, Data analysis, false data dependences, integer programming, Linear programming, Omega test, Privatization, Production, production compilers, program compilers, Program processors, program testing, program transformations, Testing},
	isbn = {1045-9219},
	doi = {10.1109/71.342135},
	author = {Pugh, William and Wonnacott,D.}
}
@article {17104,
	title = {Dynamic queries for visual information seeking},
	journal = {IEEE Software},
	volume = {11},
	year = {1994},
	month = {1994/11//},
	pages = {70 - 77},
	abstract = {Considers how dynamic queries allow users to "fly through" databases by adjusting widgets and viewing the animated results. In studies, users reacted to this approach with an enthusiasm more commonly associated with video games. Adoption requires research into retrieval and display algorithms and user-interface design. The author discusses how experts may benefit from visual interfaces because they will be able to formulate more complex queries and interpret intricate results.<>},
	keywords = {Algorithm design and analysis, animated results, animation, Application software, Command languages, complex queries, database management systems, Databases, display algorithms, Displays, dynamic queries, Educational institutions, Games, Graphical user interfaces, human factors, Query processing, retrieval, Runtime, Technological innovation, user-interface design, visual databases, visual information seeking, visual interfaces, widgets},
	isbn = {0740-7459},
	doi = {10.1109/52.329404},
	author = {Shneiderman, Ben}
}
@conference {12796,
	title = {RTSL: a language for real-time schedulability analysis},
	booktitle = {Real-Time Systems Symposium, 1993., Proceedings.},
	year = {1993},
	month = {1993/12/01/3},
	pages = {274 - 283},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {The paper develops a generalized approach to schedulability analysis that is mathematically founded in a process algebra called RTSL. Within RTSL one may describe the functional behavior, timing behavior, timing constraints (or deadlines), and scheduling discipline for real-time systems. The formal semantics of RTSL then allows the reachable state space of finite state systems to be automatically generated and searched for timing exceptions. We provide a generalized schedulability analysis technique to perform this state-based analysis},
	keywords = {Algebra, Algorithm design and analysis, Dynamic scheduling, Failure analysis, finite state machines, finite state systems, formal logic, formal semantics, functional behavior, generalized approach, generalized schedulability analysis technique, Process algebra, Processor scheduling, reachable state space, Real time systems, real-time schedulability analysis, Real-Time Specification Language, real-time systems, RTSL, scheduling, Scheduling algorithm, scheduling discipline, Specification languages, state-based analysis, State-space methods, Time factors, Timing, timing behavior, timing constraints, timing exceptions},
	isbn = {0-8186-4480-X},
	doi = {10.1109/REAL.1993.393489},
	author = {Fredette,A. N and Cleaveland, Rance}
}
